Base | Representation |
---|---|
bin | 1001000111101010000010… |
… | …0001100010011010000101 |
3 | 1022111120211002202100100000 |
4 | 2101322200201202122011 |
5 | 2303241044041040414 |
6 | 33154224015311513 |
7 | 2053303021433664 |
oct | 221724041423205 |
9 | 38446732670300 |
10 | 10027146815109 |
11 | 3216541a74006 |
12 | 115b3b321b599 |
13 | 57972c391428 |
14 | 26946066addb |
15 | 125c68328b09 |
hex | 91ea0862685 |
10027146815109 has 12 divisors (see below), whose sum is σ = 15020088233696. Its totient is φ = 6684764543244.
The previous prime is 10027146815107. The next prime is 10027146815111. The reversal of 10027146815109 is 90151864172001.
10027146815109 is a `hidden beast` number, since 1 + 0 + 0 + 2 + 71 + 4 + 68 + 1 + 510 + 9 = 666.
It is an interprime number because it is at equal distance from previous prime (10027146815107) and next prime (10027146815111).
It is not a de Polignac number, because 10027146815109 - 21 = 10027146815107 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 (10027146815107) 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 11 ways as a sum of consecutive naturals, for example, 20631989089 + ... + 20631989574.
Almost surely, 210027146815109 is an apocalyptic number.
It is an amenable number.
10027146815109 is a deficient number, since it is larger than the sum of its proper divisors (4992941418587).
10027146815109 is an frugal number, since it uses more digits than its factorization.
10027146815109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41263978678 (or 41263978666 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 45.
The spelling of 10027146815109 in words is "ten trillion, twenty-seven billion, one hundred forty-six million, eight hundred fifteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •