Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01010010001010001 |
3 | 222011001111021122100 |
4 | 21123313022101101 |
5 | 131222031334413 |
6 | 4353145031013 |
7 | 506026052412 |
oct | 113367122121 |
9 | 28131437570 |
10 | 10131121233 |
11 | 4329832372 |
12 | 1b68a85469 |
13 | c55c093bc |
14 | 6c1735809 |
15 | 3e465da73 |
hex | 25bdca451 |
10131121233 has 24 divisors (see below), whose sum is σ = 15415620480. Its totient is φ = 6393794400.
The previous prime is 10131121223. The next prime is 10131121327. The reversal of 10131121233 is 33212113101.
10131121233 is a `hidden beast` number, since 101 + 311 + 21 + 233 = 666.
10131121233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10131121233 - 214 = 10131104849 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10131121223) 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 23 ways as a sum of consecutive naturals, for example, 213208 + ... + 256358.
It is an arithmetic number, because the mean of its divisors is an integer number (642317520).
Almost surely, 210131121233 is an apocalyptic number.
It is an amenable number.
10131121233 is a deficient number, since it is larger than the sum of its proper divisors (5284499247).
10131121233 is a wasteful number, since it uses less digits than its factorization.
10131121233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44549 (or 44546 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10131121233 its reverse (33212113101), we get a palindrome (43343234334).
The spelling of 10131121233 in words is "ten billion, one hundred thirty-one million, one hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •