Base | Representation |
---|---|
bin | 11000101001100111… |
… | …10110110011000001 |
3 | 1021011022011212222200 |
4 | 30110303312303001 |
5 | 204100403240001 |
6 | 10025111223413 |
7 | 645644325000 |
oct | 142463666301 |
9 | 37138155880 |
10 | 13234040001 |
11 | 56812a8146 |
12 | 2694077b69 |
13 | 132ba16b00 |
14 | 8d788cc37 |
15 | 526c82086 |
hex | 314cf6cc1 |
13234040001 has 72 divisors (see below), whose sum is σ = 24140188800. Its totient is φ = 6980317344.
The previous prime is 13234039991. The next prime is 13234040011. The reversal of 13234040001 is 10004043231.
13234040001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13234039991) and next prime (13234040011).
It is not a de Polignac number, because 13234040001 - 27 = 13234039873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13234040011) 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 71 ways as a sum of consecutive naturals, for example, 509020 + ... + 534386.
It is an arithmetic number, because the mean of its divisors is an integer number (335280400).
Almost surely, 213234040001 is an apocalyptic number.
It is an amenable number.
13234040001 is a deficient number, since it is larger than the sum of its proper divisors (10906148799).
13234040001 is a wasteful number, since it uses less digits than its factorization.
13234040001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25420 (or 25390 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 13234040001 its reverse (10004043231), we get a palindrome (23238083232).
The spelling of 13234040001 in words is "thirteen billion, two hundred thirty-four million, forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •