Base | Representation |
---|---|
bin | 1001101001011001011010… |
… | …01001111110010111101111 |
3 | 2210010000000022222021111021 |
4 | 10310230231021332113233 |
5 | 10240030423333030211 |
6 | 113041221020435011 |
7 | 4316426544613666 |
oct | 464545511762757 |
9 | 83100008867437 |
10 | 21213601064431 |
11 | 6839701844146 |
12 | 24674080a8a67 |
13 | bab58464c659 |
14 | 534a5ac93ddd |
15 | 26bc33b51771 |
hex | 134b2d27e5ef |
21213601064431 has 8 divisors (see below), whose sum is σ = 22461506671824. Its totient is φ = 19965700648320.
The previous prime is 21213601064413. The next prime is 21213601064441. The reversal of 21213601064431 is 13446010631212.
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 21213601064431 - 223 = 21213592675823 is a prime.
It is a super-2 number, since 2×212136010644312 (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 (21213601064441) 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, 9852541 + ... + 11811001.
It is an arithmetic number, because the mean of its divisors is an integer number (2807688333978).
Almost surely, 221213601064431 is an apocalyptic number.
21213601064431 is a deficient number, since it is larger than the sum of its proper divisors (1247905607393).
21213601064431 is a wasteful number, since it uses less digits than its factorization.
21213601064431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2595641.
The product of its (nonzero) digits is 20736, while the sum is 34.
Adding to 21213601064431 its reverse (13446010631212), we get a palindrome (34659611695643).
The spelling of 21213601064431 in words is "twenty-one trillion, two hundred thirteen billion, six hundred one million, sixty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •