Base | Representation |
---|---|
bin | 101111000010010100… |
… | …1010100111010101011 |
3 | 100122201112112002110022 |
4 | 1132010221110322223 |
5 | 3123331434031044 |
6 | 114223031511055 |
7 | 10204054030121 |
oct | 1360451247253 |
9 | 318645462408 |
10 | 101009673899 |
11 | 39924367042 |
12 | 176abb2848b |
13 | 96a9a55c14 |
14 | 4c631a9911 |
15 | 2962bcc3ee |
hex | 1784a54eab |
101009673899 has 16 divisors (see below), whose sum is σ = 103364620800. Its totient is φ = 98685449280.
The previous prime is 101009673811. The next prime is 101009673907. The reversal of 101009673899 is 998376900101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101009673899 is a prime.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101009673899.
It is not an unprimeable number, because it can be changed into a prime (101009673599) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3282314 + ... + 3312944.
It is an arithmetic number, because the mean of its divisors is an integer number (6460288800).
Almost surely, 2101009673899 is an apocalyptic number.
101009673899 is a deficient number, since it is larger than the sum of its proper divisors (2354946901).
101009673899 is a wasteful number, since it uses less digits than its factorization.
101009673899 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31130.
The product of its (nonzero) digits is 734832, while the sum is 53.
The spelling of 101009673899 in words is "one hundred one billion, nine million, six hundred seventy-three thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •