Base | Representation |
---|---|
bin | 1011110110000010011101… |
… | …1010000111101101001001 |
3 | 1201002222122101211012121212 |
4 | 2331200213122013231021 |
5 | 3201332102003001301 |
6 | 43410403505142505 |
7 | 2512611062361434 |
oct | 275404732075511 |
9 | 51088571735555 |
10 | 13023002000201 |
11 | 417102a135a16 |
12 | 1563b4102aa35 |
13 | 7360aa297b1b |
14 | 330460cb481b |
15 | 178b58c3e4bb |
hex | bd827687b49 |
13023002000201 has 8 divisors (see below), whose sum is σ = 13026599139840. Its totient is φ = 13019405092848.
The previous prime is 13023002000161. The next prime is 13023002000237. The reversal of 13023002000201 is 10200020032031.
It is a happy number.
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 13023002000201 - 26 = 13023002000137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13023002300201) 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 7 ways as a sum of consecutive naturals, for example, 224710910 + ... + 224768856.
It is an arithmetic number, because the mean of its divisors is an integer number (1628324892480).
Almost surely, 213023002000201 is an apocalyptic number.
It is an amenable number.
13023002000201 is a deficient number, since it is larger than the sum of its proper divisors (3597139639).
13023002000201 is an equidigital number, since it uses as much as digits as its factorization.
13023002000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116143.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 13023002000201 its reverse (10200020032031), we get a palindrome (23223022032232).
The spelling of 13023002000201 in words is "thirteen trillion, twenty-three billion, two million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •