Base | Representation |
---|---|
bin | 1100000111011010001111… |
… | …0100011111101010101110 |
3 | 1202011111222012101122201010 |
4 | 3001312203310133222232 |
5 | 3221224303130013202 |
6 | 44155441434530050 |
7 | 2543304515654535 |
oct | 301664364375256 |
9 | 52144865348633 |
10 | 13321442032302 |
11 | 4276656813248 |
12 | 15b194bb96926 |
13 | 75828bb68cb1 |
14 | 340a92b8331c |
15 | 1817c44aa76c |
hex | c1da3d1faae |
13321442032302 has 64 divisors (see below), whose sum is σ = 27717208001280. Its totient is φ = 4264626495744.
The previous prime is 13321442032253. The next prime is 13321442032303. The reversal of 13321442032302 is 20323024412331.
It is a happy number.
It is a super-2 number, since 2×133214420323022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13321442032302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13321442032303) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20482773 + ... + 21123135.
It is an arithmetic number, because the mean of its divisors is an integer number (433081375020).
Almost surely, 213321442032302 is an apocalyptic number.
13321442032302 is an abundant number, since it is smaller than the sum of its proper divisors (14395765968978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13321442032302 is a wasteful number, since it uses less digits than its factorization.
13321442032302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641617.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 13321442032302 its reverse (20323024412331), we get a palindrome (33644466444633).
The spelling of 13321442032302 in words is "thirteen trillion, three hundred twenty-one billion, four hundred forty-two million, thirty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •