Base | Representation |
---|---|
bin | 11000000110100101110101… |
… | …000001010010110100000111 |
3 | 111220100002010222002010012000 |
4 | 120012211311001102310013 |
5 | 102343300343040343210 |
6 | 1013242301350000343 |
7 | 31220453524204152 |
oct | 3006456501226407 |
9 | 456302128063160 |
10 | 106006051106055 |
11 | 3085aa06306121 |
12 | ba808240460b3 |
13 | 471c435026469 |
14 | 1c26a12514c99 |
15 | c3c6d9ad7ac0 |
hex | 606975052d07 |
106006051106055 has 16 divisors (see below), whose sum is σ = 188455201966560. Its totient is φ = 56536560589824.
The previous prime is 106006051106047. The next prime is 106006051106057. The reversal of 106006051106055 is 550601150600601.
It is not a de Polignac number, because 106006051106055 - 23 = 106006051106047 is a prime.
It is a super-2 number, since 2×1060060511060552 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106006051106057) 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, 392615003962 + ... + 392615004231.
It is an arithmetic number, because the mean of its divisors is an integer number (11778450122910).
Almost surely, 2106006051106055 is an apocalyptic number.
106006051106055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106006051106055 is a deficient number, since it is larger than the sum of its proper divisors (82449150860505).
106006051106055 is an equidigital number, since it uses as much as digits as its factorization.
106006051106055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 785230008207 (or 785230008201 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 106006051106055 in words is "one hundred six trillion, six billion, fifty-one million, one hundred six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •