Base | Representation |
---|---|
bin | 10110101111111111011111… |
… | …000110001111011010110001 |
3 | 111010021011110102000201100221 |
4 | 112233333133012033122301 |
5 | 101103300123031144010 |
6 | 552444345114413041 |
7 | 30034510216333030 |
oct | 2657773706173261 |
9 | 433234412021327 |
10 | 100055006115505 |
11 | 299760a9583971 |
12 | b27b3b7131181 |
13 | 43aa1ba0a5c9c |
14 | 1a9c98c356717 |
15 | b879d88c7dda |
hex | 5affdf18f6b1 |
100055006115505 has 16 divisors (see below), whose sum is σ = 137306651094144. Its totient is φ = 68564968554240.
The previous prime is 100055006115457. The next prime is 100055006115509. The reversal of 100055006115505 is 505511600550001.
It is not a de Polignac number, because 100055006115505 - 27 = 100055006115377 is a prime.
It is a super-2 number, since 2×1000550061155052 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100055006115509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 920330211 + ... + 920438920.
It is an arithmetic number, because the mean of its divisors is an integer number (8581665693384).
Almost surely, 2100055006115505 is an apocalyptic number.
It is an amenable number.
100055006115505 is a deficient number, since it is larger than the sum of its proper divisors (37251644978639).
100055006115505 is a wasteful number, since it uses less digits than its factorization.
100055006115505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1840770696.
The product of its (nonzero) digits is 18750, while the sum is 34.
Adding to 100055006115505 its reverse (505511600550001), we get a palindrome (605566606665506).
The spelling of 100055006115505 in words is "one hundred trillion, fifty-five billion, six million, one hundred fifteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •