Base | Representation |
---|---|
bin | 1001101001011000010010… |
… | …11000111010010100100111 |
3 | 2210002221110111211212011021 |
4 | 10310230021120322110213 |
5 | 10240023211224001411 |
6 | 113041041303152011 |
7 | 4316405640266455 |
oct | 464541130722447 |
9 | 83087414755137 |
10 | 21213001000231 |
11 | 6839424052017 |
12 | 246727b145607 |
13 | bab4ba230791 |
14 | 534a012d19d5 |
15 | 26bbeb11ea71 |
hex | 134b0963a527 |
21213001000231 has 8 divisors (see below), whose sum is σ = 21340295665920. Its totient is φ = 21085904460768.
The previous prime is 21213001000201. The next prime is 21213001000249. The reversal of 21213001000231 is 13200010031212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21213001000231 - 233 = 21204411065639 is a prime.
It is a super-2 number, since 2×212130010002312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21213001000201) 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, 49316776 + ... + 49745053.
It is an arithmetic number, because the mean of its divisors is an integer number (2667536958240).
Almost surely, 221213001000231 is an apocalyptic number.
21213001000231 is a deficient number, since it is larger than the sum of its proper divisors (127294665689).
21213001000231 is a wasteful number, since it uses less digits than its factorization.
21213001000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99063113.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 21213001000231 its reverse (13200010031212), we get a palindrome (34413011031443).
The spelling of 21213001000231 in words is "twenty-one trillion, two hundred thirteen billion, one million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •