Base | Representation |
---|---|
bin | 11000100111000111… |
… | …01101111001000001 |
3 | 1021002211122120102121 |
4 | 30103203231321001 |
5 | 204030014011001 |
6 | 10023041044241 |
7 | 645300630121 |
oct | 142343557101 |
9 | 37084576377 |
10 | 13213032001 |
11 | 5670459564 |
12 | 2689026681 |
13 | 132756c940 |
14 | 8d4b80c81 |
15 | 524ed26a1 |
hex | 3138ede41 |
13213032001 has 16 divisors (see below), whose sum is σ = 14619813264. Its totient is φ = 11862284544.
The previous prime is 13213031989. The next prime is 13213032029. The reversal of 13213032001 is 10023031231.
13213032001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 1887815601 + 11325216400 = 43449^2 + 106420^2 .
It is a cyclic number.
It is not a de Polignac number, because 13213032001 - 25 = 13213031969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13213032601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1880571 + ... + 1887583.
It is an arithmetic number, because the mean of its divisors is an integer number (913738329).
Almost surely, 213213032001 is an apocalyptic number.
It is an amenable number.
13213032001 is a deficient number, since it is larger than the sum of its proper divisors (1406781263).
13213032001 is a wasteful number, since it uses less digits than its factorization.
13213032001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10980.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13213032001 its reverse (10023031231), we get a palindrome (23236063232).
The spelling of 13213032001 in words is "thirteen billion, two hundred thirteen million, thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •