Base | Representation |
---|---|
bin | 10111000000101010000011… |
… | …010010111010100010010001 |
3 | 111021022122110111010200002220 |
4 | 113000222003102322202101 |
5 | 101231031023340431001 |
6 | 555122423521531253 |
7 | 30213321563422446 |
oct | 2700520322724221 |
9 | 437278414120086 |
10 | 101200222202001 |
11 | 2a27785616a98a |
12 | b4253457a3b29 |
13 | 44611a878c710 |
14 | 1adc18ca5b9cd |
15 | ba76b3c4cc36 |
hex | 5c0a834ba891 |
101200222202001 has 32 divisors (see below), whose sum is σ = 146243932627968. Its totient is φ = 61878457976640.
The previous prime is 101200222201997. The next prime is 101200222202003. The reversal of 101200222202001 is 100202222002101.
It is not a de Polignac number, because 101200222202001 - 22 = 101200222201997 is a prime.
It is a super-2 number, since 2×1012002222020012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101200222202003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12480490 + ... + 18925196.
It is an arithmetic number, because the mean of its divisors is an integer number (4570122894624).
Almost surely, 2101200222202001 is an apocalyptic number.
It is an amenable number.
101200222202001 is a deficient number, since it is larger than the sum of its proper divisors (45043710425967).
101200222202001 is a wasteful number, since it uses less digits than its factorization.
101200222202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6447301.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 101200222202001 its reverse (100202222002101), we get a palindrome (201402444204102).
The spelling of 101200222202001 in words is "one hundred one trillion, two hundred billion, two hundred twenty-two million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •