Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …1010010001100100101001 |
3 | 1022110001021200012221102122 |
4 | 2101223201122101210221 |
5 | 2303010120210423001 |
6 | 33143003200041025 |
7 | 2052163201145465 |
oct | 221534132214451 |
9 | 38401250187378 |
10 | 10011055561001 |
11 | 320a7349706a0 |
12 | 1158262303175 |
13 | 5780667374b1 |
14 | 2687755434a5 |
15 | 125625809b1b |
hex | 91ae1691929 |
10011055561001 has 8 divisors (see below), whose sum is σ = 10921761141408. Its totient is φ = 9100451584000.
The previous prime is 10011055560983. The next prime is 10011055561007. The reversal of 10011055561001 is 10016555011001.
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 10011055561001 - 230 = 10009981819177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011055561007) 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 7 ways as a sum of consecutive naturals, for example, 25194755 + ... + 25589016.
It is an arithmetic number, because the mean of its divisors is an integer number (1365220142676).
Almost surely, 210011055561001 is an apocalyptic number.
10011055561001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10011055561001 is a deficient number, since it is larger than the sum of its proper divisors (910705580407).
10011055561001 is a wasteful number, since it uses less digits than its factorization.
10011055561001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50801703.
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 10011055561001 in words is "ten trillion, eleven billion, fifty-five million, five hundred sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •