Base | Representation |
---|---|
bin | 10110110000101110111110… |
… | …110111110001110111000100 |
3 | 111010110001002121112120200022 |
4 | 112300232332313301313010 |
5 | 101110114044243423220 |
6 | 552524021443034312 |
7 | 30041264061245345 |
oct | 2660567667616704 |
9 | 433401077476608 |
10 | 100106005061060 |
11 | 2999579a10a559 |
12 | b28926a66b998 |
13 | 43b1c56aa3c4b |
14 | 1aa12295dc0cc |
15 | b88ec0ce1925 |
hex | 5b0bbedf1dc4 |
100106005061060 has 12 divisors (see below), whose sum is σ = 210222610628268. Its totient is φ = 40042402024416.
The previous prime is 100106005061059. The next prime is 100106005061089. The reversal of 100106005061060 is 60160500601001.
It can be written as a sum of positive squares in 2 ways, for example, as 35757146953984 + 64348858107076 = 5979728^2 + 8021774^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2502650126507 + ... + 2502650126546.
It is an arithmetic number, because the mean of its divisors is an integer number (17518550885689).
Almost surely, 2100106005061060 is an apocalyptic number.
100106005061060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100106005061060 is an abundant number, since it is smaller than the sum of its proper divisors (110116605567208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100106005061060 is a wasteful number, since it uses less digits than its factorization.
100106005061060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5005300253062 (or 5005300253060 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 100106005061060 its reverse (60160500601001), we get a palindrome (160266505662061).
The spelling of 100106005061060 in words is "one hundred trillion, one hundred six billion, five million, sixty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •