Base | Representation |
---|---|
bin | 1100000000011110111001… |
… | …0010011100001011100010 |
3 | 1201202010210012121110121210 |
4 | 3000013232102130023202 |
5 | 3212302040132441114 |
6 | 44025040315330550 |
7 | 2531562403020210 |
oct | 300075622341342 |
9 | 51663705543553 |
10 | 13202432312034 |
11 | 4230135942a29 |
12 | 1592877a50a56 |
13 | 749ca3b97684 |
14 | 339003177cb0 |
15 | 17d65b416259 |
hex | c01ee49c2e2 |
13202432312034 has 32 divisors (see below), whose sum is σ = 30177152271360. Its totient is φ = 3772103001552.
The previous prime is 13202432312029. The next prime is 13202432312053. The reversal of 13202432312034 is 43021323420231.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13202432311992 and 13202432312010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8050737 + ... + 9550875.
It is an arithmetic number, because the mean of its divisors is an integer number (943036008480).
Almost surely, 213202432312034 is an apocalyptic number.
13202432312034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
13202432312034 is an abundant number, since it is smaller than the sum of its proper divisors (16974719959326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13202432312034 is a wasteful number, since it uses less digits than its factorization.
13202432312034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709694.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 13202432312034 its reverse (43021323420231), we get a palindrome (56223755732265).
The spelling of 13202432312034 in words is "thirteen trillion, two hundred two billion, four hundred thirty-two million, three hundred twelve thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •