Base | Representation |
---|---|
bin | 1001101001011000010111… |
… | …01111010100101110111101 |
3 | 2210002221120021001002122120 |
4 | 10310230023233110232331 |
5 | 10240023301322230023 |
6 | 113041045232233153 |
7 | 4316406626401215 |
oct | 464541357245675 |
9 | 83087507032576 |
10 | 21213040430013 |
11 | 6839444333213 |
12 | 246729039b7b9 |
13 | bab4c5457903 |
14 | 534a06637245 |
15 | 26bbee80c8e3 |
hex | 134b0bbd4bbd |
21213040430013 has 8 divisors (see below), whose sum is σ = 28307294711808. Its totient is φ = 14130406550784.
The previous prime is 21213040429981. The next prime is 21213040430027. The reversal of 21213040430013 is 31003404031212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21213040430013 - 25 = 21213040429981 is a prime.
It is a super-2 number, since 2×212130404300132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21213040430093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2905096381 + ... + 2905103682.
It is an arithmetic number, because the mean of its divisors is an integer number (3538411838976).
Almost surely, 221213040430013 is an apocalyptic number.
It is an amenable number.
21213040430013 is a deficient number, since it is larger than the sum of its proper divisors (7094254281795).
21213040430013 is a wasteful number, since it uses less digits than its factorization.
21213040430013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5810201283.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 21213040430013 its reverse (31003404031212), we get a palindrome (52216444461225).
The spelling of 21213040430013 in words is "twenty-one trillion, two hundred thirteen billion, forty million, four hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •