Base | Representation |
---|---|
bin | 10011001111101111… |
… | …11101011000000101 |
3 | 222200002201100221211 |
4 | 21213313331120011 |
5 | 132130130012112 |
6 | 4425144411421 |
7 | 514024064614 |
oct | 114767753005 |
9 | 28602640854 |
10 | 10332657157 |
11 | 4422574289 |
12 | 2004476b71 |
13 | c888b0824 |
14 | 7003d787b |
15 | 4071bd0a7 |
hex | 267dfd605 |
10332657157 has 4 divisors (see below), whose sum is σ = 10406992960. Its totient is φ = 10258321356.
The previous prime is 10332657131. The next prime is 10332657169. The reversal of 10332657157 is 75175623301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 75175623301 = 2819 ⋅26667479.
It is a cyclic number.
It is not a de Polignac number, because 10332657157 - 219 = 10332132869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10332657557) 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, 37167693 + ... + 37167970.
It is an arithmetic number, because the mean of its divisors is an integer number (2601748240).
Almost surely, 210332657157 is an apocalyptic number.
It is an amenable number.
10332657157 is a deficient number, since it is larger than the sum of its proper divisors (74335803).
10332657157 is an equidigital number, since it uses as much as digits as its factorization.
10332657157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74335802.
The product of its (nonzero) digits is 132300, while the sum is 40.
It can be divided in two parts, 10332 and 657157, that added together give a square (667489 = 8172).
The spelling of 10332657157 in words is "ten billion, three hundred thirty-two million, six hundred fifty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •