Base | Representation |
---|---|
bin | 10110101111101011000001… |
… | …011001111101000010010011 |
3 | 111010012001202001222101222211 |
4 | 112233223001121331002103 |
5 | 101102420122440131011 |
6 | 552430312505212551 |
7 | 30033101546130133 |
oct | 2657530131750223 |
9 | 433161661871884 |
10 | 100033033130131 |
11 | 29967853389822 |
12 | b2770a4491157 |
13 | 43a80c7a221aa |
14 | 1a9b8a6008ac3 |
15 | b8714e833b21 |
hex | 5afac167d093 |
100033033130131 has 2 divisors, whose sum is σ = 100033033130132. Its totient is φ = 100033033130130.
The previous prime is 100033033130123. The next prime is 100033033130137. The reversal of 100033033130131 is 131031330330001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100033033130131 - 23 = 100033033130123 is a prime.
It is a super-2 number, since 2×1000330331301312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100033033130137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50016516565065 + 50016516565066.
It is an arithmetic number, because the mean of its divisors is an integer number (50016516565066).
Almost surely, 2100033033130131 is an apocalyptic number.
100033033130131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100033033130131 is an equidigital number, since it uses as much as digits as its factorization.
100033033130131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 100033033130131 its reverse (131031330330001), we get a palindrome (231064363460132).
The spelling of 100033033130131 in words is "one hundred trillion, thirty-three billion, thirty-three million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •