Base | Representation |
---|---|
bin | 1011110110100100110001… |
… | …0111100001110100100001 |
3 | 1201010212102021002022002212 |
4 | 2331221030113201310201 |
5 | 3202004432233343241 |
6 | 43414525431451505 |
7 | 2513355235236635 |
oct | 275511427416441 |
9 | 51125367068085 |
10 | 13032212012321 |
11 | 4174a25a28387 |
12 | 1565891526b95 |
13 | 736c173c9638 |
14 | 330a96156dc5 |
15 | 178ee75a1beb |
hex | bda4c5e1d21 |
13032212012321 has 8 divisors (see below), whose sum is σ = 13059748289280. Its totient is φ = 13004677107792.
The previous prime is 13032212012293. The next prime is 13032212012341. The reversal of 13032212012321 is 12321021223031.
13032212012321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13032212012321 - 26 = 13032212012257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13032212012341) 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, 19931831 + ... + 20575283.
It is an arithmetic number, because the mean of its divisors is an integer number (1632468536160).
Almost surely, 213032212012321 is an apocalyptic number.
It is an amenable number.
13032212012321 is a deficient number, since it is larger than the sum of its proper divisors (27536276959).
13032212012321 is an equidigital number, since it uses as much as digits as its factorization.
13032212012321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 686215.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13032212012321 its reverse (12321021223031), we get a palindrome (25353233235352).
The spelling of 13032212012321 in words is "thirteen trillion, thirty-two billion, two hundred twelve million, twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •