Base | Representation |
---|---|
bin | 11000000110100001000001… |
… | …111110110100100001101101 |
3 | 111220022120211222002022121111 |
4 | 120012201001332310201231 |
5 | 102343204320330234042 |
6 | 1013240050252432021 |
7 | 31220212054236004 |
oct | 3006410176644155 |
9 | 456276758068544 |
10 | 106000899852397 |
11 | 3085880258aaa0 |
12 | ba7b826a78611 |
13 | 471bac3a4a184 |
14 | 1c2668431dc3b |
15 | c3c4d7755517 |
hex | 606841fb486d |
106000899852397 has 16 divisors (see below), whose sum is σ = 122443614582912. Its totient is φ = 90692940421120.
The previous prime is 106000899852373. The next prime is 106000899852413. The reversal of 106000899852397 is 793258998000601.
It is a cyclic number.
It is not a de Polignac number, because 106000899852397 - 227 = 106000765634669 is a prime.
It is a super-2 number, since 2×1060008998523972 (a number of 29 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 (106000899852317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3780913 + ... + 15043174.
It is an arithmetic number, because the mean of its divisors is an integer number (7652725911432).
Almost surely, 2106000899852397 is an apocalyptic number.
106000899852397 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
106000899852397 is a deficient number, since it is larger than the sum of its proper divisors (16442714730515).
106000899852397 is a wasteful number, since it uses less digits than its factorization.
106000899852397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18854228.
The product of its (nonzero) digits is 58786560, while the sum is 67.
The spelling of 106000899852397 in words is "one hundred six trillion, eight hundred ninety-nine million, eight hundred fifty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •