Base | Representation |
---|---|
bin | 1001011101001110110111… |
… | …1111011000010010111110 |
3 | 1100211000120111211121101211 |
4 | 2113103231333120102332 |
5 | 2330324210244433402 |
6 | 34040404544355034 |
7 | 2122134341635504 |
oct | 227235577302276 |
9 | 40730514747354 |
10 | 10397813671102 |
11 | 3349762824130 |
12 | 11bb1ba915a7a |
13 | 5a5681840a10 |
14 | 27d384bb2674 |
15 | 13070e9204d7 |
hex | 974edfd84be |
10397813671102 has 16 divisors (see below), whose sum is σ = 18323419896432. Its totient is φ = 4362719022720.
The previous prime is 10397813671067. The next prime is 10397813671129. The reversal of 10397813671102 is 20117631879301.
It is a super-2 number, since 2×103978136711022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18177995643 + ... + 18177996214.
It is an arithmetic number, because the mean of its divisors is an integer number (1145213743527).
Almost surely, 210397813671102 is an apocalyptic number.
10397813671102 is a deficient number, since it is larger than the sum of its proper divisors (7925606225330).
10397813671102 is a wasteful number, since it uses less digits than its factorization.
10397813671102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36355991883.
The product of its (nonzero) digits is 381024, while the sum is 49.
The spelling of 10397813671102 in words is "ten trillion, three hundred ninety-seven billion, eight hundred thirteen million, six hundred seventy-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •