Base | Representation |
---|---|
bin | 111100010100111… |
… | …010001100110110 |
3 | 2121112110201201020 |
4 | 330110322030312 |
5 | 4033100123410 |
6 | 244233042010 |
7 | 34036554231 |
oct | 7424721466 |
9 | 2545421636 |
10 | 1012114230 |
11 | 47a348446 |
12 | 242b56306 |
13 | 1318bc17a |
14 | 985c2418 |
15 | 5dcc5a70 |
hex | 3c53a336 |
1012114230 has 128 divisors (see below), whose sum is σ = 2631398400. Its totient is φ = 248371200.
The previous prime is 1012114189. The next prime is 1012114247. The reversal of 1012114230 is 324112101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3601690 + ... + 3601970.
It is an arithmetic number, because the mean of its divisors is an integer number (20557800).
Almost surely, 21012114230 is an apocalyptic number.
1012114230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1012114230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1315699200).
1012114230 is an abundant number, since it is smaller than the sum of its proper divisors (1619284170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012114230 is a wasteful number, since it uses less digits than its factorization.
1012114230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 470.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1012114230 is about 31813.7427851550. The cubic root of 1012114230 is about 1004.0218794669.
Adding to 1012114230 its reverse (324112101), we get a palindrome (1336226331).
The spelling of 1012114230 in words is "one billion, twelve million, one hundred fourteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •