Base | Representation |
---|---|
bin | 10011110100100001… |
… | …10000101100110111 |
3 | 1000110121012100211112 |
4 | 21322100300230313 |
5 | 133243113224402 |
6 | 4515524425235 |
7 | 524461162136 |
oct | 117220605467 |
9 | 30417170745 |
10 | 10641148727 |
11 | 45707185a0 |
12 | 208b84821b |
13 | 1007792711 |
14 | 72d37b91d |
15 | 424307e52 |
hex | 27a430b37 |
10641148727 has 16 divisors (see below), whose sum is σ = 12212380800. Its totient is φ = 9181868640.
The previous prime is 10641148703. The next prime is 10641148747. The reversal of 10641148727 is 72784114601.
10641148727 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 10641148727 - 218 = 10640886583 is a prime.
It is a super-2 number, since 2×106411487272 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10641148747) 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 15 ways as a sum of consecutive naturals, for example, 263873 + ... + 301514.
It is an arithmetic number, because the mean of its divisors is an integer number (763273800).
Almost surely, 210641148727 is an apocalyptic number.
10641148727 is a deficient number, since it is larger than the sum of its proper divisors (1571232073).
10641148727 is a wasteful number, since it uses less digits than its factorization.
10641148727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565486.
The product of its (nonzero) digits is 75264, while the sum is 41.
The spelling of 10641148727 in words is "ten billion, six hundred forty-one million, one hundred forty-eight thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •