Base | Representation |
---|---|
bin | 1001100011110100111010… |
… | …11011101010100111111100 |
3 | 2202102201000001012220202002 |
4 | 10301322131123222213330 |
5 | 10223411442033101022 |
6 | 112413245344121432 |
7 | 4266542664033140 |
oct | 461723533524774 |
9 | 82381001186662 |
10 | 21022211222012 |
11 | 6775519206860 |
12 | 24362b4006278 |
13 | b965030b76a0 |
14 | 5296a2509220 |
15 | 266c81550092 |
hex | 131e9d6ea9fc |
21022211222012 has 48 divisors (see below), whose sum is σ = 49394845957632. Its totient is φ = 7560435602880.
The previous prime is 21022211222011. The next prime is 21022211222027.
21022211222012 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21022211222011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2625147248 + ... + 2625155255.
It is an arithmetic number, because the mean of its divisors is an integer number (1029059290784).
Almost surely, 221022211222012 is an apocalyptic number.
21022211222012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21022211222012 is an abundant number, since it is smaller than the sum of its proper divisors (28372634735620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21022211222012 is a wasteful number, since it uses less digits than its factorization.
21022211222012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5250302538 (or 5250302536 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
It can be divided in two parts, 2102221 and 1222012, that added together give a palindrome (3324233).
The spelling of 21022211222012 in words is "twenty-one trillion, twenty-two billion, two hundred eleven million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •