Base | Representation |
---|---|
bin | 10010110111110101… |
… | …11100011110110011 |
3 | 222011010100200112201 |
4 | 21123322330132303 |
5 | 131222310111311 |
6 | 4353222204031 |
7 | 506040354004 |
oct | 113372743663 |
9 | 28133320481 |
10 | 10132113331 |
11 | 432a34a78a |
12 | 1b69283617 |
13 | c56195b42 |
14 | 6c19131ab |
15 | 3e47a79c1 |
hex | 25bebc7b3 |
10132113331 has 4 divisors (see below), whose sum is σ = 10132792600. Its totient is φ = 10131434064.
The previous prime is 10132113323. The next prime is 10132113353. The reversal of 10132113331 is 13331123101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13331123101 = 59 ⋅225951239.
It is a cyclic number.
It is not a de Polignac number, because 10132113331 - 23 = 10132113323 is a prime.
It is a super-2 number, since 2×101321133312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10132113299 and 10132113308.
It is not an unprimeable number, because it can be changed into a prime (10132513331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 316746 + ... + 347263.
It is an arithmetic number, because the mean of its divisors is an integer number (2533198150).
Almost surely, 210132113331 is an apocalyptic number.
10132113331 is a deficient number, since it is larger than the sum of its proper divisors (679269).
10132113331 is an equidigital number, since it uses as much as digits as its factorization.
10132113331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679268.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10132113331 its reverse (13331123101), we get a palindrome (23463236432).
The spelling of 10132113331 in words is "ten billion, one hundred thirty-two million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •