Base | Representation |
---|---|
bin | 10110101111100000111011… |
… | …110101010110110101000011 |
3 | 111010011000210020201210002110 |
4 | 112233200323311112311003 |
5 | 101102230432232412011 |
6 | 552421322041350403 |
7 | 30032236262043054 |
oct | 2657407365266503 |
9 | 433130706653073 |
10 | 100022202232131 |
11 | 299631a564a853 |
12 | b274b81198403 |
13 | 43a708cb541ca |
14 | 1a9b15979672b |
15 | b86c18a48ba6 |
hex | 5af83bd56d43 |
100022202232131 has 16 divisors (see below), whose sum is σ = 139475458803456. Its totient is φ = 63638295822816.
The previous prime is 100022202232037. The next prime is 100022202232133. The reversal of 100022202232131 is 131232202220001.
It is not a de Polignac number, because 100022202232131 - 245 = 64837830143299 is a prime.
It is a super-2 number, since 2×1000222022321312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100022202232098 and 100022202232107.
It is not an unprimeable number, because it can be changed into a prime (100022202232133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1636083580 + ... + 1636144713.
It is an arithmetic number, because the mean of its divisors is an integer number (8717216175216).
Almost surely, 2100022202232131 is an apocalyptic number.
100022202232131 is a deficient number, since it is larger than the sum of its proper divisors (39453256571325).
100022202232131 is a wasteful number, since it uses less digits than its factorization.
100022202232131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3272228762.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 100022202232131 its reverse (131232202220001), we get a palindrome (231254404452132).
The spelling of 100022202232131 in words is "one hundred trillion, twenty-two billion, two hundred two million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •