Base | Representation |
---|---|
bin | 1001000110101110010111… |
… | …0110110011111011001001 |
3 | 1022110001110212120111010102 |
4 | 2101223211312303323021 |
5 | 2303010243304304401 |
6 | 33143014422455145 |
7 | 2052165065146046 |
oct | 221534566637311 |
9 | 38401425514112 |
10 | 10011130150601 |
11 | 320a772a86998 |
12 | 11582832944b5 |
13 | 578079022058 |
14 | 2687813dc1cd |
15 | 12562c14056b |
hex | 91ae5db3ec9 |
10011130150601 has 8 divisors (see below), whose sum is σ = 10549826351424. Its totient is φ = 9481053089200.
The previous prime is 10011130150583. The next prime is 10011130150657. The reversal of 10011130150601 is 10605103111001.
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 10011130150601 - 214 = 10011130134217 is a prime.
It is a super-2 number, since 2×100111301506012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011130140601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2154782471 + ... + 2154787116.
It is an arithmetic number, because the mean of its divisors is an integer number (1318728293928).
Almost surely, 210011130150601 is an apocalyptic number.
It is an amenable number.
10011130150601 is a deficient number, since it is larger than the sum of its proper divisors (538696200823).
10011130150601 is a wasteful number, since it uses less digits than its factorization.
10011130150601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4309569711.
The product of its (nonzero) digits is 90, while the sum is 20.
Adding to 10011130150601 its reverse (10605103111001), we get a palindrome (20616233261602).
The spelling of 10011130150601 in words is "ten trillion, eleven billion, one hundred thirty million, one hundred fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •