Base | Representation |
---|---|
bin | 1011000000011000001011… |
… | …1110001110001100110000 |
3 | 1120211212002212121121201212 |
4 | 2300012002332032030300 |
5 | 3041231043234101000 |
6 | 41423102231215252 |
7 | 2356164016506245 |
oct | 260060276161460 |
9 | 46755085547655 |
10 | 12101120222000 |
11 | 3946068987307 |
12 | 1435340817528 |
13 | 69a191310484 |
14 | 2db9a97235cc |
15 | 15eba0687c35 |
hex | b0182f8e330 |
12101120222000 has 80 divisors (see below), whose sum is σ = 29262611820000. Its totient is φ = 4840100179200.
The previous prime is 12101120221979. The next prime is 12101120222057. The reversal of 12101120222000 is 22202110121.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×121011202220002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28567751 + ... + 28988249.
It is an arithmetic number, because the mean of its divisors is an integer number (365782647750).
Almost surely, 212101120222000 is an apocalyptic number.
12101120222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12101120222000 is an abundant number, since it is smaller than the sum of its proper divisors (17161491598000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101120222000 is a wasteful number, since it uses less digits than its factorization.
12101120222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 434911 (or 434895 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12101120222000 its reverse (22202110121), we get a palindrome (12123322332121).
The spelling of 12101120222000 in words is "twelve trillion, one hundred one billion, one hundred twenty million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •