Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …01111001111010100000 |
3 | 10122111010120101100011222 |
4 | 32333130311321322200 |
5 | 113334323242131422 |
6 | 2105133550354212 |
7 | 134300242040654 |
oct | 16773465717240 |
9 | 3574116340158 |
10 | 1030202302112 |
11 | 3679a7384555 |
12 | 1477b07bb968 |
13 | 761bc542a19 |
14 | 37c0d6b2a64 |
15 | 1bbe8001842 |
hex | efdcd79ea0 |
1030202302112 has 48 divisors (see below), whose sum is σ = 2064942421920. Its totient is φ = 505792420608.
The previous prime is 1030202302091. The next prime is 1030202302159. The reversal of 1030202302112 is 2112032020301.
It is a super-2 number, since 2×10302023021122 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1344683 + ... + 1966869.
It is an arithmetic number, because the mean of its divisors is an integer number (43019633790).
Almost surely, 21030202302112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1030202302112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1032471210960).
1030202302112 is an abundant number, since it is smaller than the sum of its proper divisors (1034740119808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030202302112 is an equidigital number, since it uses as much as digits as its factorization.
1030202302112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 623133 (or 623125 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1030202302112 its reverse (2112032020301), we get a palindrome (3142234322413).
The spelling of 1030202302112 in words is "one trillion, thirty billion, two hundred two million, three hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •