Base | Representation |
---|---|
bin | 10110111000000000001110… |
… | …000110100111001110010011 |
3 | 111012012210111210112001020222 |
4 | 112320000032012213032103 |
5 | 101141310131420243201 |
6 | 553545315112423255 |
7 | 30122340221013362 |
oct | 2670001606471623 |
9 | 435183453461228 |
10 | 100605550556051 |
11 | 2a068635564682 |
12 | b34a0433a7b2b |
13 | 441a0a7a08638 |
14 | 1abb49830d7d9 |
15 | b96eaba9691b |
hex | 5b800e1a7393 |
100605550556051 has 8 divisors (see below), whose sum is σ = 102256329994464. Its totient is φ = 98954819766720.
The previous prime is 100605550555999. The next prime is 100605550556081. The reversal of 100605550556051 is 150655055506001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100605550556051 - 26 = 100605550555987 is a prime.
It is a super-2 number, since 2×1006055505560512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100605550555993 and 100605550556011.
It is not an unprimeable number, because it can be changed into a prime (100605550556081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7980671 + ... + 16275816.
It is an arithmetic number, because the mean of its divisors is an integer number (12782041249308).
Almost surely, 2100605550556051 is an apocalyptic number.
100605550556051 is a deficient number, since it is larger than the sum of its proper divisors (1650779438413).
100605550556051 is an equidigital number, since it uses as much as digits as its factorization.
100605550556051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24324541.
The product of its (nonzero) digits is 562500, while the sum is 44.
The spelling of 100605550556051 in words is "one hundred trillion, six hundred five billion, five hundred fifty million, five hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •