Base | Representation |
---|---|
bin | 101110110110111000001… |
… | …001111101000110010000 |
3 | 102101211102201221112101112 |
4 | 232312320021331012100 |
5 | 410224100122401000 |
6 | 10503131250152452 |
7 | 451432046302523 |
oct | 56667011750620 |
9 | 12354381845345 |
10 | 3220020122000 |
11 | 103166a45a950 |
12 | 44008a282728 |
13 | 1a48537507c6 |
14 | b1bc7c1abba |
15 | 58b605ab235 |
hex | 2edb827d190 |
3220020122000 has 160 divisors (see below), whose sum is σ = 8573215457664. Its totient is φ = 1159972416000.
The previous prime is 3220020121949. The next prime is 3220020122003. The reversal of 3220020122000 is 2210200223.
3220020122000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (3220020122003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1670054 + ... + 3037946.
Almost surely, 23220020122000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3220020122000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4286607728832).
3220020122000 is an abundant number, since it is smaller than the sum of its proper divisors (5353195335664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3220020122000 is a wasteful number, since it uses less digits than its factorization.
3220020122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368034 (or 1368018 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 3220020122000 its reverse (2210200223), we get a palindrome (3222230322223).
The spelling of 3220020122000 in words is "three trillion, two hundred twenty billion, twenty million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •