Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …00111000001111100011 |
3 | 10122111010112212200012102 |
4 | 32333130310320033203 |
5 | 113334323210024443 |
6 | 2105133540521015 |
7 | 134300236540514 |
oct | 16773464701743 |
9 | 3574115780172 |
10 | 1030202033123 |
11 | 3679a721044a |
12 | 1477b06b016b |
13 | 761bc47a463 |
14 | 37c0d642a0b |
15 | 1bbe7e9bcb8 |
hex | efdcd383e3 |
1030202033123 has 8 divisors (see below), whose sum is σ = 1032606184896. Its totient is φ = 1027799980200.
The previous prime is 1030202033111. The next prime is 1030202033129. The reversal of 1030202033123 is 3213302020301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030202033123 - 230 = 1029128291299 is a prime.
It is a super-2 number, since 2×10302020331232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030202033095 and 1030202033104.
It is not an unprimeable number, because it can be changed into a prime (1030202033129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 460268 + ... + 1507398.
It is an arithmetic number, because the mean of its divisors is an integer number (129075773112).
Almost surely, 21030202033123 is an apocalyptic number.
1030202033123 is a deficient number, since it is larger than the sum of its proper divisors (2404151773).
1030202033123 is a wasteful number, since it uses less digits than its factorization.
1030202033123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049425.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 1030202033123 its reverse (3213302020301), we get a palindrome (4243504053424).
The spelling of 1030202033123 in words is "one trillion, thirty billion, two hundred two million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •