Base | Representation |
---|---|
bin | 11000011101010101… |
… | …10010100011010101 |
3 | 1020220010021220201010 |
4 | 30032222302203111 |
5 | 203343014000041 |
6 | 10010550522433 |
7 | 643253441616 |
oct | 141652624325 |
9 | 36803256633 |
10 | 13131000021 |
11 | 562911a737 |
12 | 2665666419 |
13 | 131357a6c9 |
14 | 8c7d09c0d |
15 | 51cbcba16 |
hex | 30eab28d5 |
13131000021 has 16 divisors (see below), whose sum is σ = 17575152768. Its totient is φ = 8720462400.
The previous prime is 13131000017. The next prime is 13131000031. The reversal of 13131000021 is 12000013131.
13131000021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13131000021 - 22 = 13131000017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13130999970 and 13131000006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131000031) 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, 1737511 + ... + 1745051.
It is an arithmetic number, because the mean of its divisors is an integer number (1098447048).
Almost surely, 213131000021 is an apocalyptic number.
It is an amenable number.
13131000021 is a deficient number, since it is larger than the sum of its proper divisors (4444152747).
13131000021 is a wasteful number, since it uses less digits than its factorization.
13131000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9692.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 13131000021 its reverse (12000013131), we get a palindrome (25131013152).
The spelling of 13131000021 in words is "thirteen billion, one hundred thirty-one million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •