Base | Representation |
---|---|
bin | 11011010101011100101000… |
… | …000101001001101001010000 |
3 | 120202200000200022020110120121 |
4 | 123111130220011021221100 |
5 | 111224200304104134300 |
6 | 1103404451204320024 |
7 | 34215454660306645 |
oct | 3325345005115120 |
9 | 522600608213517 |
10 | 120221102021200 |
11 | 35340534a2a254 |
12 | 115977a39a3014 |
13 | 5210a5553140b |
14 | 2198a3793ddcc |
15 | dd736047a81a |
hex | 6d5728149a50 |
120221102021200 has 120 divisors (see below), whose sum is σ = 299165913156096. Its totient is φ = 46378369344000.
The previous prime is 120221102021159. The next prime is 120221102021221. The reversal of 120221102021200 is 2120201122021.
It is a happy number.
It is a super-2 number, since 2×1202211020212002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
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, 12911596 + ... + 20177995.
Almost surely, 2120221102021200 is an apocalyptic number.
120221102021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120221102021200 is an abundant number, since it is smaller than the sum of its proper divisors (178944811134896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120221102021200 is a wasteful number, since it uses less digits than its factorization.
120221102021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33089933 (or 33089922 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 120221102021200 its reverse (2120201122021), we get a palindrome (122341303143221).
The spelling of 120221102021200 in words is "one hundred twenty trillion, two hundred twenty-one billion, one hundred two million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •