Base | Representation |
---|---|
bin | 10111000000101010000010… |
… | …101001000001111000000011 |
3 | 111021022122102201110211101220 |
4 | 113000222002221001320003 |
5 | 101231031013033101034 |
6 | 555122422450330123 |
7 | 30213321401202030 |
oct | 2700520251017003 |
9 | 437278381424356 |
10 | 101200211222019 |
11 | 2a27784aa50518 |
12 | b425341b89943 |
13 | 44611a6416aa0 |
14 | 1adc18b400387 |
15 | ba76b2cce749 |
hex | 5c0a82a41e03 |
101200211222019 has 32 divisors (see below), whose sum is σ = 169934284337664. Its totient is φ = 52138928136960.
The previous prime is 101200211221979. The next prime is 101200211222107. The reversal of 101200211222019 is 910222112002101.
It is not a de Polignac number, because 101200211222019 - 28 = 101200211221763 is a prime.
It is a super-2 number, since 2×1012002112220192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101200211222019.
It is not an unprimeable number, because it can be changed into a prime (101200211232019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4310415522 + ... + 4310438999.
It is an arithmetic number, because the mean of its divisors is an integer number (5310446385552).
Almost surely, 2101200211222019 is an apocalyptic number.
101200211222019 is a deficient number, since it is larger than the sum of its proper divisors (68734073115645).
101200211222019 is a wasteful number, since it uses less digits than its factorization.
101200211222019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8620854587.
The product of its (nonzero) digits is 288, while the sum is 24.
The spelling of 101200211222019 in words is "one hundred one trillion, two hundred billion, two hundred eleven million, two hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •