Base | Representation |
---|---|
bin | 10000010011000110011… |
… | …001010001010011100100 |
3 | 10222001222010020122211110 |
4 | 100103012121101103210 |
5 | 121322300110311322 |
6 | 2214310255505020 |
7 | 143630066002155 |
oct | 20230631212344 |
9 | 3861863218743 |
10 | 1120020010212 |
11 | 3a1aa8107a84 |
12 | 161098528170 |
13 | 8180466ab6c |
14 | 3c2d02bb92c |
15 | 1e203370c0c |
hex | 104c66514e4 |
1120020010212 has 12 divisors (see below), whose sum is σ = 2613380023856. Its totient is φ = 373340003400.
The previous prime is 1120020010189. The next prime is 1120020010223. The reversal of 1120020010212 is 2120100200211.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 93335000851 = 1120020010212 / (1 + 1 + 2 + 0 + 0 + 2 + 0 + 0 + 1 + 0 + 2 + 1 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46667500414 + ... + 46667500437.
Almost surely, 21120020010212 is an apocalyptic number.
1120020010212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1120020010212 is an abundant number, since it is smaller than the sum of its proper divisors (1493360013644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120020010212 is a wasteful number, since it uses less digits than its factorization.
1120020010212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93335000858 (or 93335000856 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1120020010212 its reverse (2120100200211), we get a palindrome (3240120210423).
The spelling of 1120020010212 in words is "one trillion, one hundred twenty billion, twenty million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •