Base | Representation |
---|---|
bin | 1001100011100010101110… |
… | …01101010100011010011110 |
3 | 2202101202210021210222122121 |
4 | 10301301113031110122132 |
5 | 10223231440414340220 |
6 | 112404552203533154 |
7 | 4266045633404344 |
oct | 461612715243236 |
9 | 82352707728577 |
10 | 21012443121310 |
11 | 6771366392163 |
12 | 243442882a1ba |
13 | b95607472b44 |
14 | 5290170ad994 |
15 | 2668adbeceaa |
hex | 131c5735469e |
21012443121310 has 8 divisors (see below), whose sum is σ = 37822397618376. Its totient is φ = 8404977248520.
The previous prime is 21012443121239. The next prime is 21012443121317. The reversal of 21012443121310 is 1312134421012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×210124431213102 (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 (21012443121317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1050622156056 + ... + 1050622156075.
It is an arithmetic number, because the mean of its divisors is an integer number (4727799702297).
Almost surely, 221012443121310 is an apocalyptic number.
21012443121310 is a deficient number, since it is larger than the sum of its proper divisors (16809954497066).
21012443121310 is a wasteful number, since it uses less digits than its factorization.
21012443121310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2101244312138.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 21012443121310 its reverse (1312134421012), we get a palindrome (22324577542322).
The spelling of 21012443121310 in words is "twenty-one trillion, twelve billion, four hundred forty-three million, one hundred twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •