Base | Representation |
---|---|
bin | 10010111001011101… |
… | …00100010001001001 |
3 | 222012001211012101101 |
4 | 21130232210101021 |
5 | 131234241130031 |
6 | 4354424221401 |
7 | 506263364545 |
oct | 113456442111 |
9 | 28161735341 |
10 | 10145645641 |
11 | 4336a5280a |
12 | 1b7190a861 |
13 | c58c23421 |
14 | 6c3636a25 |
15 | 3e5a7c361 |
hex | 25cba4449 |
10145645641 has 2 divisors, whose sum is σ = 10145645642. Its totient is φ = 10145645640.
The previous prime is 10145645639. The next prime is 10145645651. The reversal of 10145645641 is 14654654101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9939292416 + 206353225 = 99696^2 + 14365^2 .
It is a cyclic number.
It is not a de Polignac number, because 10145645641 - 21 = 10145645639 is a prime.
Together with 10145645639, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10145645641.
It is not a weakly prime, because it can be changed into another prime (10145645651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5072822820 + 5072822821.
It is an arithmetic number, because the mean of its divisors is an integer number (5072822821).
Almost surely, 210145645641 is an apocalyptic number.
It is an amenable number.
10145645641 is a deficient number, since it is larger than the sum of its proper divisors (1).
10145645641 is an equidigital number, since it uses as much as digits as its factorization.
10145645641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 37.
The spelling of 10145645641 in words is "ten billion, one hundred forty-five million, six hundred forty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •