Base | Representation |
---|---|
bin | 1001101001010110100111… |
… | …11000100010010110111110 |
3 | 2210002212010221201000210011 |
4 | 10310223103320202112332 |
5 | 10240014341422233042 |
6 | 113040412234533434 |
7 | 4316344460165065 |
oct | 464532370422676 |
9 | 83085127630704 |
10 | 21212103321022 |
11 | 6839003365379 |
12 | 246706a59727a |
13 | bab3a626a553 |
14 | 534957dbb1dc |
15 | 26bb97400a17 |
hex | 134ad3e225be |
21212103321022 has 4 divisors (see below), whose sum is σ = 31818154981536. Its totient is φ = 10606051660510.
The previous prime is 21212103321007. The next prime is 21212103321037. The reversal of 21212103321022 is 22012330121212.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (21212103321007) and next prime (21212103321037).
It is a super-3 number, since 3×212121033210223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21212103320984 and 21212103321002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5303025830254 + ... + 5303025830257.
It is an arithmetic number, because the mean of its divisors is an integer number (7954538745384).
Almost surely, 221212103321022 is an apocalyptic number.
21212103321022 is a deficient number, since it is larger than the sum of its proper divisors (10606051660514).
21212103321022 is a wasteful number, since it uses less digits than its factorization.
21212103321022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10606051660513.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 21212103321022 its reverse (22012330121212), we get a palindrome (43224433442234).
The spelling of 21212103321022 in words is "twenty-one trillion, two hundred twelve billion, one hundred three million, three hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •