Base | Representation |
---|---|
bin | 1001111110100010110110… |
… | …1000000111100101100000 |
3 | 1102211201202222001012210000 |
4 | 2133220231220013211200 |
5 | 2414213242130344121 |
6 | 35155333323140000 |
7 | 2211364413113523 |
oct | 237505550074540 |
9 | 42751688035700 |
10 | 10970111965536 |
11 | 354a44223a289 |
12 | 12920b8374600 |
13 | 617628301b69 |
14 | 29cd55d54bba |
15 | 1405577ea526 |
hex | 9fa2da07960 |
10970111965536 has 60 divisors (see below), whose sum is σ = 32262794572932. Its totient is φ = 3656703987648.
The previous prime is 10970111965493. The next prime is 10970111965573. The reversal of 10970111965536 is 63556911107901.
10970111965536 is a `hidden beast` number, since 1 + 0 + 9 + 7 + 0 + 1 + 11 + 96 + 5 + 536 = 666.
It is a super-2 number, since 2×109701119655362 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2116145550 + ... + 2116150733.
Almost surely, 210970111965536 is an apocalyptic number.
10970111965536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10970111965536 is an abundant number, since it is smaller than the sum of its proper divisors (21292682607396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10970111965536 is an equidigital number, since it uses as much as digits as its factorization.
10970111965536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4232296305 (or 4232296288 counting only the distinct ones).
The product of its (nonzero) digits is 1530900, while the sum is 54.
The spelling of 10970111965536 in words is "ten trillion, nine hundred seventy billion, one hundred eleven million, nine hundred sixty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •