Base | Representation |
---|---|
bin | 1011000000011000110110… |
… | …1100110111110000011001 |
3 | 1120211212120102022121200121 |
4 | 2300012031230313300121 |
5 | 3041231430324114001 |
6 | 41423132141233241 |
7 | 2356201333500433 |
oct | 260061554676031 |
9 | 46755512277617 |
10 | 12101300223001 |
11 | 394615054a770 |
12 | 1435390b62821 |
13 | 69a1bc6b4942 |
14 | 2db9c55bb653 |
15 | 15ebb13916a1 |
hex | b018db37c19 |
12101300223001 has 8 divisors (see below), whose sum is σ = 13243063281984. Its totient is φ = 10966477973520.
The previous prime is 12101300222987. The next prime is 12101300223017. The reversal of 12101300223001 is 10032200310121.
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 12101300223001 - 29 = 12101300222489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12101300223301) 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, 1735198725 + ... + 1735205698.
It is an arithmetic number, because the mean of its divisors is an integer number (1655382910248).
Almost surely, 212101300223001 is an apocalyptic number.
12101300223001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12101300223001 is a deficient number, since it is larger than the sum of its proper divisors (1141763058983).
12101300223001 is a wasteful number, since it uses less digits than its factorization.
12101300223001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3470404751.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12101300223001 its reverse (10032200310121), we get a palindrome (22133500533122).
The spelling of 12101300223001 in words is "twelve trillion, one hundred one billion, three hundred million, two hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •