Base | Representation |
---|---|
bin | 1001001011111101111010… |
… | …1000010101110110101011 |
3 | 1022202122222012222000111201 |
4 | 2102333132220111312223 |
5 | 2310444231011330443 |
6 | 33252232333305031 |
7 | 2061534142533325 |
oct | 222773650256653 |
9 | 38678865860451 |
10 | 10101203230123 |
11 | 3244994981785 |
12 | 1171820635177 |
13 | 583702020745 |
14 | 26cc87cc0615 |
15 | 127b4eb0534d |
hex | 92fdea15dab |
10101203230123 has 8 divisors (see below), whose sum is σ = 10407430087200. Its totient is φ = 9799259266368.
The previous prime is 10101203230121. The next prime is 10101203230169. The reversal of 10101203230123 is 32103230210101.
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 10101203230123 - 21 = 10101203230121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10101203230123.
It is not an unprimeable number, because it can be changed into a prime (10101203230121) 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, 1070718543 + ... + 1070727976.
It is an arithmetic number, because the mean of its divisors is an integer number (1300928760900).
Almost surely, 210101203230123 is an apocalyptic number.
10101203230123 is a deficient number, since it is larger than the sum of its proper divisors (306226857077).
10101203230123 is an equidigital number, since it uses as much as digits as its factorization.
10101203230123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2141446661.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10101203230123 its reverse (32103230210101), we get a palindrome (42204433440224).
The spelling of 10101203230123 in words is "ten trillion, one hundred one billion, two hundred three million, two hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •