Base | Representation |
---|---|
bin | 11101111110111101001… |
… | …00100110101010001110 |
3 | 10122111012120222122221010 |
4 | 32333132210212222032 |
5 | 113334403204234410 |
6 | 2105140504350050 |
7 | 134301043512546 |
oct | 16773644465216 |
9 | 3574176878833 |
10 | 1030231321230 |
11 | 367a117a4aa1 |
12 | 1477ba475326 |
13 | 761c55633b7 |
14 | 37c134a8326 |
15 | 1bbea834c20 |
hex | efde926a8e |
1030231321230 has 32 divisors (see below), whose sum is σ = 2475245721600. Its totient is φ = 274429402272.
The previous prime is 1030231321201. The next prime is 1030231321253. The reversal of 1030231321230 is 321231320301.
It is a super-2 number, since 2×10302313212302 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1030231321197 and 1030231321206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18656350 + ... + 18711489.
It is an arithmetic number, because the mean of its divisors is an integer number (77351428800).
Almost surely, 21030231321230 is an apocalyptic number.
1030231321230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030231321230 is an abundant number, since it is smaller than the sum of its proper divisors (1445014400370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030231321230 is a wasteful number, since it uses less digits than its factorization.
1030231321230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37368768.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1030231321230 its reverse (321231320301), we get a palindrome (1351462641531).
The spelling of 1030231321230 in words is "one trillion, thirty billion, two hundred thirty-one million, three hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •