Base | Representation |
---|---|
bin | 11000000110100100110110… |
… | …101010111100100100111100 |
3 | 111220022222110001202111022210 |
4 | 120012210312222330210330 |
5 | 102343241222243413122 |
6 | 1013242005501340420 |
7 | 31220415563025333 |
oct | 3006446652744474 |
9 | 456288401674283 |
10 | 106005005060412 |
11 | 3085a5198a2597 |
12 | ba80591867710 |
13 | 471c2c93b6a43 |
14 | 1c2695361cd1a |
15 | c3c677d5d40c |
hex | 606936abc93c |
106005005060412 has 48 divisors (see below), whose sum is σ = 248358258283520. Its totient is φ = 35190536856192.
The previous prime is 106005005060393. The next prime is 106005005060447. The reversal of 106005005060412 is 214060500500601.
It is a super-2 number, since 2×1060050050604122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106005005060412.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14811958 + ... + 20770269.
Almost surely, 2106005005060412 is an apocalyptic number.
106005005060412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106005005060412 is an abundant number, since it is smaller than the sum of its proper divisors (142353253223108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106005005060412 is a wasteful number, since it uses less digits than its factorization.
106005005060412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35583250 (or 35583248 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 106005005060412 in words is "one hundred six trillion, five billion, five million, sixty thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •