Base | Representation |
---|---|
bin | 1001001101101101101101… |
… | …0011000110001010001001 |
3 | 1022212112102120221120101102 |
4 | 2103123123103012022021 |
5 | 2311442210244201413 |
6 | 33314114203431145 |
7 | 2063645610654500 |
oct | 223333323061211 |
9 | 38775376846342 |
10 | 10131212100233 |
11 | 3256694123a84 |
12 | 11775b65254b5 |
13 | 5864a51a0013 |
14 | 2704d3597837 |
15 | 1288093d2458 |
hex | 936db4c6289 |
10131212100233 has 24 divisors (see below), whose sum is σ = 11963528544672. Its totient is φ = 8552611355904.
The previous prime is 10131212100221. The next prime is 10131212100257. The reversal of 10131212100233 is 33200121213101.
It is a happy number.
It is not a de Polignac number, because 10131212100233 - 28 = 10131212099977 is a prime.
It is a super-3 number, since 3×101312121002333 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10131212100263) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16617866 + ... + 17216732.
It is an arithmetic number, because the mean of its divisors is an integer number (498480356028).
Almost surely, 210131212100233 is an apocalyptic number.
It is an amenable number.
10131212100233 is a deficient number, since it is larger than the sum of its proper divisors (1832316444439).
10131212100233 is an equidigital number, since it uses as much as digits as its factorization.
10131212100233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604101 (or 604094 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10131212100233 its reverse (33200121213101), we get a palindrome (43331333313334).
The spelling of 10131212100233 in words is "ten trillion, one hundred thirty-one billion, two hundred twelve million, one hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •