Base | Representation |
---|---|
bin | 1001001101001111111110… |
… | …0110011010101000010001 |
3 | 1022211202211101111100011022 |
4 | 2103103333212122220101 |
5 | 2311324334142210001 |
6 | 33310314225325225 |
7 | 2063244051345110 |
oct | 223237746325021 |
9 | 38752741440138 |
10 | 10123231210001 |
11 | 3253269119028 |
12 | 1175b49796815 |
13 | 5858028bb070 |
14 | 26dd77665c77 |
15 | 1284dd90e11b |
hex | 934ff99aa11 |
10123231210001 has 64 divisors (see below), whose sum is σ = 12673011326976. Its totient is φ = 7873041369600.
The previous prime is 10123231209997. The next prime is 10123231210031. The reversal of 10123231210001 is 10001213232101.
It is a cyclic number.
It is not a de Polignac number, because 10123231210001 - 22 = 10123231209997 is a prime.
It is a super-2 number, since 2×101232312100012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10123231210031) 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 63 ways as a sum of consecutive naturals, for example, 2757620396 + ... + 2757624066.
It is an arithmetic number, because the mean of its divisors is an integer number (198015801984).
Almost surely, 210123231210001 is an apocalyptic number.
It is an amenable number.
10123231210001 is a deficient number, since it is larger than the sum of its proper divisors (2549780116975).
10123231210001 is a wasteful number, since it uses less digits than its factorization.
10123231210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5062.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10123231210001 its reverse (10001213232101), we get a palindrome (20124444442102).
The spelling of 10123231210001 in words is "ten trillion, one hundred twenty-three billion, two hundred thirty-one million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •