Base | Representation |
---|---|
bin | 1001101001101011010011… |
… | …11110001111010110010100 |
3 | 2210010220211002101111121122 |
4 | 10310311221332033112110 |
5 | 10240210114100124022 |
6 | 113045450402103112 |
7 | 4320216650552513 |
oct | 464655176172624 |
9 | 83126732344548 |
10 | 21223211333012 |
11 | 6842793567177 |
12 | 246924a64aa98 |
13 | bac456682400 |
14 | 5352cd36667a |
15 | 26c0e76c8742 |
hex | 134d69f8f594 |
21223211333012 has 18 divisors (see below), whose sum is σ = 40217357571678. Its totient is φ = 9795328307232.
The previous prime is 21223211333011. The next prime is 21223211333017. The reversal of 21223211333012 is 21033311232212.
It can be written as a sum of positive squares in 3 ways, for example, as 2620500489616 + 18602710843396 = 1618796^2 + 4313086^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21223211333011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15697640843 + ... + 15697642194.
It is an arithmetic number, because the mean of its divisors is an integer number (2234297642871).
Almost surely, 221223211333012 is an apocalyptic number.
It is an amenable number.
21223211333012 is a deficient number, since it is larger than the sum of its proper divisors (18994146238666).
21223211333012 is a wasteful number, since it uses less digits than its factorization.
21223211333012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31395283067 (or 31395283052 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 21223211333012 its reverse (21033311232212), we get a palindrome (42256522565224).
The spelling of 21223211333012 in words is "twenty-one trillion, two hundred twenty-three billion, two hundred eleven million, three hundred thirty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •