Base | Representation |
---|---|
bin | 1001010111101010101110… |
… | …1001011001010000110011 |
3 | 1100110212210211011112121012 |
4 | 2111322223221121100303 |
5 | 2322242412100043443 |
6 | 33524434234421135 |
7 | 2112211254311315 |
oct | 225725351312063 |
9 | 40425724145535 |
10 | 10302211331123 |
11 | 331216379a0a8 |
12 | 11a47798917ab |
13 | 59965715518a |
14 | 2788b5c1b7b5 |
15 | 12ceb680b118 |
hex | 95eaba59433 |
10302211331123 has 16 divisors (see below), whose sum is σ = 10488856860000. Its totient is φ = 10117508474112.
The previous prime is 10302211331033. The next prime is 10302211331173. The reversal of 10302211331123 is 32113311220301.
It is a cyclic number.
It is not a de Polignac number, because 10302211331123 - 228 = 10301942895667 is a prime.
It is a super-2 number, since 2×103022113311232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10302211331173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7480223 + ... + 8749751.
It is an arithmetic number, because the mean of its divisors is an integer number (655553553750).
Almost surely, 210302211331123 is an apocalyptic number.
10302211331123 is a deficient number, since it is larger than the sum of its proper divisors (186645528877).
10302211331123 is a wasteful number, since it uses less digits than its factorization.
10302211331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270294.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10302211331123 its reverse (32113311220301), we get a palindrome (42415522551424).
The spelling of 10302211331123 in words is "ten trillion, three hundred two billion, two hundred eleven million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •