Base | Representation |
---|---|
bin | 11110101101010001101… |
… | …11000110111001110001 |
3 | 10201212101201210202010001 |
4 | 33112220313012321301 |
5 | 114241321100143001 |
6 | 2124412314510001 |
7 | 136141235034646 |
oct | 17265067067161 |
9 | 3655351722101 |
10 | 1055100006001 |
11 | 3775134a0a38 |
12 | 15059aa35301 |
13 | 786598105a2 |
14 | 390d222bdcd |
15 | 1c6a3c19001 |
hex | f5a8dc6e71 |
1055100006001 has 8 divisors (see below), whose sum is σ = 1063603948544. Its totient is φ = 1046599127280.
The previous prime is 1055100005987. The next prime is 1055100006019. The reversal of 1055100006001 is 1006000015501.
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 1055100006001 - 215 = 1055099973233 is a prime.
It is a super-2 number, since 2×10551000060012 (a number of 25 digits) contains 22 as substring.
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 1055100006001.
It is not an unprimeable number, because it can be changed into a prime (1055100106001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71910 + ... + 1454431.
It is an arithmetic number, because the mean of its divisors is an integer number (132950493568).
Almost surely, 21055100006001 is an apocalyptic number.
It is an amenable number.
1055100006001 is a deficient number, since it is larger than the sum of its proper divisors (8503942543).
1055100006001 is a wasteful number, since it uses less digits than its factorization.
1055100006001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1531911.
The product of its (nonzero) digits is 150, while the sum is 19.
The spelling of 1055100006001 in words is "one trillion, fifty-five billion, one hundred million, six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •