Base | Representation |
---|---|
bin | 1010000000010100011100… |
… | …11111111101000011011010 |
3 | 2212220021222101012220010020 |
4 | 11000022032133331003122 |
5 | 10340431441041400242 |
6 | 114443115014531310 |
7 | 4430351400563343 |
oct | 500121637750332 |
9 | 85807871186106 |
10 | 22001213231322 |
11 | 7012731331536 |
12 | 2573b95966b36 |
13 | c37922cc2b60 |
14 | 560c15cc30ca |
15 | 28247e6146ec |
hex | 14028e7fd0da |
22001213231322 has 128 divisors (see below), whose sum is σ = 49578842880000. Its totient is φ = 6462072158976.
The previous prime is 22001213231317. The next prime is 22001213231359. The reversal of 22001213231322 is 22313231210022.
It is a junction number, because it is equal to n+sod(n) for n = 22001213231292 and 22001213231301.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 120683883 + ... + 120866049.
It is an arithmetic number, because the mean of its divisors is an integer number (387334710000).
Almost surely, 222001213231322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22001213231322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24789421440000).
22001213231322 is an abundant number, since it is smaller than the sum of its proper divisors (27577629648678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001213231322 is a wasteful number, since it uses less digits than its factorization.
22001213231322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182820.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 22001213231322 its reverse (22313231210022), we get a palindrome (44314444441344).
The spelling of 22001213231322 in words is "twenty-two trillion, one billion, two hundred thirteen million, two hundred thirty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •