Base | Representation |
---|---|
bin | 11101011001010010000… |
… | …01011010010000010101 |
3 | 10120120000000122000220201 |
4 | 32230221001122100111 |
5 | 113021442410100401 |
6 | 2051553512100501 |
7 | 132653610345022 |
oct | 16545101322025 |
9 | 3516000560821 |
10 | 1010005550101 |
11 | 35a382890869 |
12 | 1438b4994731 |
13 | 7432117a2a2 |
14 | 36c55212549 |
15 | 1b414d6db01 |
hex | eb2905a415 |
1010005550101 has 8 divisors (see below), whose sum is σ = 1069648968384. Its totient is φ = 951672976320.
The previous prime is 1010005550053. The next prime is 1010005550119. The reversal of 1010005550101 is 1010555000101.
It is a happy number.
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 1010005550101 - 29 = 1010005549589 is a prime.
It is a super-2 number, since 2×10100055501012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010005551101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 327709540 + ... + 327712621.
It is an arithmetic number, because the mean of its divisors is an integer number (133706121048).
Almost surely, 21010005550101 is an apocalyptic number.
It is an amenable number.
1010005550101 is a deficient number, since it is larger than the sum of its proper divisors (59643418283).
1010005550101 is an equidigital number, since it uses as much as digits as its factorization.
1010005550101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655422251.
The product of its (nonzero) digits is 125, while the sum is 19.
The spelling of 1010005550101 in words is "one trillion, ten billion, five million, five hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •