Base | Representation |
---|---|
bin | 1001001101000101000110… |
… | …1010010111101101001111 |
3 | 1022211111022000101110201200 |
4 | 2103101101222113231033 |
5 | 2311302400112323043 |
6 | 33305112502240543 |
7 | 2063111535146265 |
oct | 223212152275517 |
9 | 38744260343650 |
10 | 10120313011023 |
11 | 3252000949a36 |
12 | 1175474426153 |
13 | 5854591478c7 |
14 | 26db7bc74435 |
15 | 1283bc6277d3 |
hex | 93451a97b4f |
10120313011023 has 48 divisors (see below), whose sum is σ = 15258680626176. Its totient is φ = 6456378015360.
The previous prime is 10120313011007. The next prime is 10120313011033. The reversal of 10120313011023 is 32011031302101.
It is not a de Polignac number, because 10120313011023 - 24 = 10120313011007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10120313010987 and 10120313011005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120313011033) 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 47 ways as a sum of consecutive naturals, for example, 16019715 + ... + 16639467.
It is an arithmetic number, because the mean of its divisors is an integer number (317889179712).
Almost surely, 210120313011023 is an apocalyptic number.
10120313011023 is a deficient number, since it is larger than the sum of its proper divisors (5138367615153).
10120313011023 is a wasteful number, since it uses less digits than its factorization.
10120313011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 620444 (or 620441 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10120313011023 its reverse (32011031302101), we get a palindrome (42131344313124).
The spelling of 10120313011023 in words is "ten trillion, one hundred twenty billion, three hundred thirteen million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •