Base | Representation |
---|---|
bin | 10011110110111101… |
… | …10111010101101011 |
3 | 1000112000201120110101 |
4 | 21323132313111223 |
5 | 133313333420042 |
6 | 4521535330231 |
7 | 525130205260 |
oct | 117336672553 |
9 | 30460646411 |
10 | 10661623147 |
11 | 45812322aa |
12 | 2096680977 |
13 | 100bab0a66 |
14 | 731d8b267 |
15 | 425eee6b7 |
hex | 27b7b756b |
10661623147 has 4 divisors (see below), whose sum is σ = 12184712176. Its totient is φ = 9138534120.
The previous prime is 10661623139. The next prime is 10661623157. The reversal of 10661623147 is 74132616601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74132616601 = 17 ⋅4360742153.
It is a cyclic number.
It is not a de Polignac number, because 10661623147 - 23 = 10661623139 is a prime.
It is a super-2 number, since 2×106616231472 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10661623157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 761544504 + ... + 761544517.
It is an arithmetic number, because the mean of its divisors is an integer number (3046178044).
Almost surely, 210661623147 is an apocalyptic number.
10661623147 is a deficient number, since it is larger than the sum of its proper divisors (1523089029).
10661623147 is an equidigital number, since it uses as much as digits as its factorization.
10661623147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1523089028.
The product of its (nonzero) digits is 36288, while the sum is 37.
The spelling of 10661623147 in words is "ten billion, six hundred sixty-one million, six hundred twenty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •