Base | Representation |
---|---|
bin | 10011100101100111… |
… | …100000111001011101 |
3 | 2000021202210222012020 |
4 | 103211213200321131 |
5 | 321033221210023 |
6 | 13355001130353 |
7 | 1343124556353 |
oct | 234547407135 |
9 | 60252728166 |
10 | 21032210013 |
11 | 8a13152751 |
12 | 40ab7899b9 |
13 | 1ca24b19a9 |
14 | 10374197d3 |
15 | 8316b0de3 |
hex | 4e59e0e5d |
21032210013 has 4 divisors (see below), whose sum is σ = 28042946688. Its totient is φ = 14021473340.
The previous prime is 21032209987. The next prime is 21032210027. The reversal of 21032210013 is 31001223012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21032210013 - 212 = 21032205917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21032209974 and 21032210001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21037210013) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3505368333 + ... + 3505368338.
It is an arithmetic number, because the mean of its divisors is an integer number (7010736672).
Almost surely, 221032210013 is an apocalyptic number.
It is an amenable number.
21032210013 is a deficient number, since it is larger than the sum of its proper divisors (7010736675).
21032210013 is an equidigital number, since it uses as much as digits as its factorization.
21032210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7010736674.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 21032210013 its reverse (31001223012), we get a palindrome (52033433025).
The spelling of 21032210013 in words is "twenty-one billion, thirty-two million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •