Base | Representation |
---|---|
bin | 1001001101001111110110… |
… | …1111010111000000000001 |
3 | 1022211202202012202201002101 |
4 | 2103103331233113000001 |
5 | 2311324303200000001 |
6 | 33310311152350401 |
7 | 2063243222146624 |
oct | 223237557270001 |
9 | 38752665681071 |
10 | 10123200000001 |
11 | 3253252541540 |
12 | 1175b3b245401 |
13 | 5857c92b13ca |
14 | 26dd7345ddbb |
15 | 1284dace6a01 |
hex | 934fdbd7001 |
10123200000001 has 16 divisors (see below), whose sum is σ = 11427094958400. Its totient is φ = 8883394273600.
The previous prime is 10123199999951. The next prime is 10123200000007. The reversal of 10123200000001 is 10000000232101.
10123200000001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10123200000001 - 215 = 10123199967233 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10123200000007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2573506 + ... + 5183563.
It is an arithmetic number, because the mean of its divisors is an integer number (714193434900).
Almost surely, 210123200000001 is an apocalyptic number.
10123200000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10123200000001 is a deficient number, since it is larger than the sum of its proper divisors (1303894958399).
10123200000001 is a wasteful number, since it uses less digits than its factorization.
10123200000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7761200.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 10123200000001 its reverse (10000000232101), we get a palindrome (20123200232102).
The spelling of 10123200000001 in words is "ten trillion, one hundred twenty-three billion, two hundred million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •