Base | Representation |
---|---|
bin | 111011111110111010010… |
… | …111010001100010101000 |
3 | 112121001121021210002110012 |
4 | 323332322113101202220 |
5 | 1020013324034101300 |
6 | 12433342031511052 |
7 | 603543003310406 |
oct | 73767227214250 |
9 | 15531537702405 |
10 | 4122000300200 |
11 | 134a148788952 |
12 | 566a55688488 |
13 | 23b91a533993 |
14 | 1037121bc476 |
15 | 72351882435 |
hex | 3bfba5d18a8 |
4122000300200 has 96 divisors (see below), whose sum is σ = 9667263621600. Its totient is φ = 1634467196160.
The previous prime is 4122000300109. The next prime is 4122000300221. The reversal of 4122000300200 is 20030002214.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12518879 + ... + 12843921.
It is an arithmetic number, because the mean of its divisors is an integer number (100700662725).
Almost surely, 24122000300200 is an apocalyptic number.
4122000300200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4122000300200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4833631810800).
4122000300200 is an abundant number, since it is smaller than the sum of its proper divisors (5545263321400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4122000300200 is a wasteful number, since it uses less digits than its factorization.
4122000300200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325611 (or 325602 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 4122000300200 its reverse (20030002214), we get a palindrome (4142030302414).
The spelling of 4122000300200 in words is "four trillion, one hundred twenty-two billion, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •