Base | Representation |
---|---|
bin | 1001101100001101010101… |
… | …11010000011100010010101 |
3 | 2210110020100111002202222220 |
4 | 10312012222322003202111 |
5 | 10243121242211213023 |
6 | 113153434253212553 |
7 | 4326416424103155 |
oct | 466065272034225 |
9 | 83406314082886 |
10 | 21310200101013 |
11 | 687667244607a |
12 | 2482086a91159 |
13 | bb770a6898b5 |
14 | 5395c2376765 |
15 | 26e4d94e33e3 |
hex | 1361aae83895 |
21310200101013 has 8 divisors (see below), whose sum is σ = 28413630962400. Its totient is φ = 14206784653488.
The previous prime is 21310200101011. The next prime is 21310200101087. The reversal of 21310200101013 is 31010100201312.
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 21310200101013 - 21 = 21310200101011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21310200100983 and 21310200101001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21310200101011) 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, 107278 + ... + 6529311.
It is an arithmetic number, because the mean of its divisors is an integer number (3551703870300).
Almost surely, 221310200101013 is an apocalyptic number.
It is an amenable number.
21310200101013 is a deficient number, since it is larger than the sum of its proper divisors (7103430861387).
21310200101013 is a wasteful number, since it uses less digits than its factorization.
21310200101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7706931.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 21310200101013 its reverse (31010100201312), we get a palindrome (52320300302325).
The spelling of 21310200101013 in words is "twenty-one trillion, three hundred ten billion, two hundred million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •