Base | Representation |
---|---|
bin | 10010110111110000… |
… | …10011100011111001 |
3 | 222011002001112102212 |
4 | 21123320103203321 |
5 | 131222120441213 |
6 | 4353155304505 |
7 | 506031442550 |
oct | 113370234371 |
9 | 28132045385 |
10 | 10131421433 |
11 | 4329a17971 |
12 | 1b68bab135 |
13 | c55cb2c33 |
14 | 6c17b2d97 |
15 | 3e46bc9a8 |
hex | 25be138f9 |
10131421433 has 32 divisors (see below), whose sum is σ = 12307680000. Its totient is φ = 8146725120.
The previous prime is 10131421429. The next prime is 10131421463. The reversal of 10131421433 is 33412413101.
It is a cyclic number.
It is not a de Polignac number, because 10131421433 - 22 = 10131421429 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10131421399 and 10131421408.
It is not an unprimeable number, because it can be changed into a prime (10131421463) 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, 9135083 + ... + 9136191.
It is an arithmetic number, because the mean of its divisors is an integer number (384615000).
Almost surely, 210131421433 is an apocalyptic number.
It is an amenable number.
10131421433 is a deficient number, since it is larger than the sum of its proper divisors (2176258567).
10131421433 is a wasteful number, since it uses less digits than its factorization.
10131421433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1745.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10131421433 its reverse (33412413101), we get a palindrome (43543834534).
The spelling of 10131421433 in words is "ten billion, one hundred thirty-one million, four hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •