Base | Representation |
---|---|
bin | 10110111111010111111010… |
… | …001001111001000011011000 |
3 | 111021000012210122220210022121 |
4 | 112333113322021321003120 |
5 | 101223104410113341440 |
6 | 555014115513431024 |
7 | 30204050110242640 |
oct | 2677277211710330 |
9 | 437005718823277 |
10 | 101112022012120 |
11 | 2a243405493879 |
12 | b41022b70b474 |
13 | 4455a907c1c52 |
14 | 1ad7bc2bc7520 |
15 | ba52508dd34a |
hex | 5bf5fa2790d8 |
101112022012120 has 32 divisors (see below), whose sum is σ = 260002342317600. Its totient is φ = 34666978975488.
The previous prime is 101112022012117. The next prime is 101112022012151. The reversal of 101112022012120 is 21210220211101.
It is a junction number, because it is equal to n+sod(n) for n = 101112022012094 and 101112022012103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 180557181885 + ... + 180557182444.
It is an arithmetic number, because the mean of its divisors is an integer number (8125073197425).
Almost surely, 2101112022012120 is an apocalyptic number.
101112022012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101112022012120 is an abundant number, since it is smaller than the sum of its proper divisors (158890320305480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112022012120 is a wasteful number, since it uses less digits than its factorization.
101112022012120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361114364347 (or 361114364343 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101112022012120 its reverse (21210220211101), we get a palindrome (122322242223221).
The spelling of 101112022012120 in words is "one hundred one trillion, one hundred twelve billion, twenty-two million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.044 sec. • engine limits •