Base | Representation |
---|---|
bin | 10110110110100011000110… |
… | …001111000001111000101011 |
3 | 111011212020102022200201001121 |
4 | 112312203012033001320223 |
5 | 101133140342000230201 |
6 | 553431341144000111 |
7 | 30112200325021441 |
oct | 2666430617017053 |
9 | 434766368621047 |
10 | 100505560555051 |
11 | 2a02a194838a13 |
12 | b332798a60037 |
13 | 44108312ba182 |
14 | 1ab66d0732b91 |
15 | b945a86849a1 |
hex | 5b68c63c1e2b |
100505560555051 has 4 divisors (see below), whose sum is σ = 101500665115104. Its totient is φ = 99510455995000.
The previous prime is 100505560555027. The next prime is 100505560555097. The reversal of 100505560555051 is 150555065505001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100505560555051 - 211 = 100505560553003 is a prime.
It is a super-2 number, since 2×1005055605550512 (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 = 100505560554989 and 100505560555007.
It is not an unprimeable number, because it can be changed into a prime (100505560555151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 497552279875 + ... + 497552280076.
It is an arithmetic number, because the mean of its divisors is an integer number (25375166278776).
Almost surely, 2100505560555051 is an apocalyptic number.
100505560555051 is a deficient number, since it is larger than the sum of its proper divisors (995104560053).
100505560555051 is an equidigital number, since it uses as much as digits as its factorization.
100505560555051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 995104560052.
The product of its (nonzero) digits is 468750, while the sum is 43.
The spelling of 100505560555051 in words is "one hundred trillion, five hundred five billion, five hundred sixty million, five hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •