Base | Representation |
---|---|
bin | 10110110110100100000001… |
… | …001111110011101111011001 |
3 | 111011212022222022122221222122 |
4 | 112312210001033303233121 |
5 | 101133144403424140001 |
6 | 553432023312231025 |
7 | 30112234006262546 |
oct | 2666440117635731 |
9 | 434768868587878 |
10 | 100506550615001 |
11 | 2a02a652692683 |
12 | b332a1453b475 |
13 | 441095b456b6b |
14 | 1ab6786013bcd |
15 | b94615550b1b |
hex | 5b69013f3bd9 |
100506550615001 has 8 divisors (see below), whose sum is σ = 100534810975560. Its totient is φ = 100478290977792.
The previous prime is 100506550614989. The next prime is 100506550615007. The reversal of 100506550615001 is 100516055605001.
It can be written as a sum of positive squares in 4 ways, for example, as 6400641942601 + 94105908672400 = 2529949^2 + 9700820^2 .
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 100506550615001 - 214 = 100506550598617 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (100506550615007) 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, 401205881 + ... + 401456313.
It is an arithmetic number, because the mean of its divisors is an integer number (12566851371945).
Almost surely, 2100506550615001 is an apocalyptic number.
It is an amenable number.
100506550615001 is a deficient number, since it is larger than the sum of its proper divisors (28260360559).
100506550615001 is a wasteful number, since it uses less digits than its factorization.
100506550615001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 361675.
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 100506550615001 in words is "one hundred trillion, five hundred six billion, five hundred fifty million, six hundred fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •