Base | Representation |
---|---|
bin | 1001101001111111110010… |
… | …00000101010000101101111 |
3 | 2210011222011222110122001000 |
4 | 10310333321000222011233 |
5 | 10240400120431341221 |
6 | 113054505101451343 |
7 | 4321056203551314 |
oct | 464777100520557 |
9 | 83158158418030 |
10 | 21234201043311 |
11 | 6847412a07183 |
12 | 246b3b6b70b53 |
13 | bb04b8416379 |
14 | 535a52b18d0b |
15 | 26c53c3d3e26 |
hex | 134ff902a16f |
21234201043311 has 32 divisors (see below), whose sum is σ = 31469137571520. Its totient is φ = 14151157235712.
The previous prime is 21234201043277. The next prime is 21234201043333. The reversal of 21234201043311 is 11334010243212.
21234201043311 is a `hidden beast` number, since 2 + 1 + 2 + 342 + 0 + 1 + 0 + 4 + 3 + 311 = 666.
It is not a de Polignac number, because 21234201043311 - 222 = 21234196849007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21234201043411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1346229421 + ... + 1346245193.
It is an arithmetic number, because the mean of its divisors is an integer number (983410549110).
Almost surely, 221234201043311 is an apocalyptic number.
21234201043311 is a deficient number, since it is larger than the sum of its proper divisors (10234936528209).
21234201043311 is a wasteful number, since it uses less digits than its factorization.
21234201043311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30152 (or 30146 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 21234201043311 its reverse (11334010243212), we get a palindrome (32568211286523).
The spelling of 21234201043311 in words is "twenty-one trillion, two hundred thirty-four billion, two hundred one million, forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •