Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …1010111101100101100001 |
3 | 1022210121021101121121110011 |
4 | 2103020212322331211201 |
5 | 2311124320014134401 |
6 | 33300533153004521 |
7 | 2062332104000554 |
oct | 223104672754541 |
9 | 38717241547404 |
10 | 10111006005601 |
11 | 324906532a016 |
12 | 11736b7553741 |
13 | 584604bb5cc7 |
14 | 26d537b8469b |
15 | 128025506451 |
hex | 93226ebd961 |
10111006005601 has 8 divisors (see below), whose sum is σ = 10720660884480. Its totient is φ = 9503005551168.
The previous prime is 10111006005577. The next prime is 10111006005631. The reversal of 10111006005601 is 10650060011101.
10111006005601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10111006005601 - 27 = 10111006005473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111006005631) 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, 413593521 + ... + 413617966.
It is an arithmetic number, because the mean of its divisors is an integer number (1340082610560).
Almost surely, 210111006005601 is an apocalyptic number.
It is an amenable number.
10111006005601 is a deficient number, since it is larger than the sum of its proper divisors (609654878879).
10111006005601 is an equidigital number, since it uses as much as digits as its factorization.
10111006005601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 827212223.
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 10111006005601 its reverse (10650060011101), we get a palindrome (20761066016702).
The spelling of 10111006005601 in words is "ten trillion, one hundred eleven billion, six million, five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •