Base | Representation |
---|---|
bin | 1011110110100100000001… |
… | …1001100001110100100101 |
3 | 1201010211220021020111010122 |
4 | 2331221000121201310211 |
5 | 3202004024332210041 |
6 | 43414453455531325 |
7 | 2513350246401326 |
oct | 275510031416445 |
9 | 51124807214118 |
10 | 13032011210021 |
11 | 4174932647671 |
12 | 1565836229b45 |
13 | 736bb49210cb |
14 | 330a7760644d |
15 | 178ed4b39c4b |
hex | bda40661d25 |
13032011210021 has 8 divisors (see below), whose sum is σ = 13080702036864. Its totient is φ = 12983324811840.
The previous prime is 13032011210003. The next prime is 13032011210033. The reversal of 13032011210021 is 12001211023031.
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 13032011210021 - 218 = 13032010947877 is a prime.
It is a super-2 number, since 2×130320112100212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032011210921) 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, 4848866 + ... + 7040988.
It is an arithmetic number, because the mean of its divisors is an integer number (1635087754608).
Almost surely, 213032011210021 is an apocalyptic number.
It is an amenable number.
13032011210021 is a deficient number, since it is larger than the sum of its proper divisors (48690826843).
13032011210021 is a wasteful number, since it uses less digits than its factorization.
13032011210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2214331.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13032011210021 its reverse (12001211023031), we get a palindrome (25033222233052).
The spelling of 13032011210021 in words is "thirteen trillion, thirty-two billion, eleven million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •