Base | Representation |
---|---|
bin | 1010000001000000000111… |
… | …0000011111100111111001 |
3 | 1102222202201220111220002201 |
4 | 2200100001300133213321 |
5 | 2420411220330332401 |
6 | 35230554220430201 |
7 | 2214420460313032 |
oct | 240200160374771 |
9 | 42882656456081 |
10 | 11012325636601 |
11 | 3566334805143 |
12 | 129a3196a8361 |
13 | 61b5c4b91553 |
14 | 2a0ddc51ba89 |
15 | 1416c87eeb01 |
hex | a0401c1f9f9 |
11012325636601 has 8 divisors (see below), whose sum is σ = 11251700049600. Its totient is φ = 10775157439728.
The previous prime is 11012325636593. The next prime is 11012325636619. The reversal of 11012325636601 is 10663652321011.
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 11012325636601 - 23 = 11012325636593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012325636661) 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, 551543941 + ... + 551563906.
It is an arithmetic number, because the mean of its divisors is an integer number (1406462506200).
Almost surely, 211012325636601 is an apocalyptic number.
It is an amenable number.
11012325636601 is a deficient number, since it is larger than the sum of its proper divisors (239374412999).
11012325636601 is a wasteful number, since it uses less digits than its factorization.
11012325636601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103108063.
The product of its (nonzero) digits is 38880, while the sum is 37.
Adding to 11012325636601 its reverse (10663652321011), we get a palindrome (21675977957612).
The spelling of 11012325636601 in words is "eleven trillion, twelve billion, three hundred twenty-five million, six hundred thirty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.389 sec. • engine limits •