Base | Representation |
---|---|
bin | 11011010101001001010000… |
… | …001111111110111101110010 |
3 | 120202121000222122122212002200 |
4 | 123111021100033332331302 |
5 | 111223330204041110302 |
6 | 1103351131144524030 |
7 | 34214120341435212 |
oct | 3325112017767562 |
9 | 522530878585080 |
10 | 120200301113202 |
11 | 353327303aa1a2 |
12 | 11593759780616 |
13 | 520babbc4652b |
14 | 2197a23134242 |
15 | dd6a4425881c |
hex | 6d52503fef72 |
120200301113202 has 48 divisors (see below), whose sum is σ = 261300331294080. Its totient is φ = 39933684606816.
The previous prime is 120200301113159. The next prime is 120200301113293. The reversal of 120200301113202 is 202311103002021.
120200301113202 is a `hidden beast` number, since 1 + 2 + 0 + 200 + 30 + 111 + 320 + 2 = 666.
It is a super-2 number, since 2×1202003011132022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 1236253 + ... + 15554064.
It is an arithmetic number, because the mean of its divisors is an integer number (5443756901960).
Almost surely, 2120200301113202 is an apocalyptic number.
120200301113202 is an abundant number, since it is smaller than the sum of its proper divisors (141100030180878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120200301113202 is a wasteful number, since it uses less digits than its factorization.
120200301113202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16791647 (or 16791644 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 120200301113202 its reverse (202311103002021), we get a palindrome (322511404115223).
The spelling of 120200301113202 in words is "one hundred twenty trillion, two hundred billion, three hundred one million, one hundred thirteen thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •