Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …00100110111110110001 |
3 | 10120122211101002211121000 |
4 | 32231222110212332301 |
5 | 113031213340231001 |
6 | 2052254325352213 |
7 | 133023012363624 |
oct | 16555224467661 |
9 | 3518741084530 |
10 | 1011101102001 |
11 | 35a895238161 |
12 | 143b5b868669 |
13 | 74467131453 |
14 | 36d1a913dbb |
15 | 1b47b126a86 |
hex | eb6a526fb1 |
1011101102001 has 8 divisors (see below), whose sum is σ = 1497927558560. Its totient is φ = 674067401316.
The previous prime is 1011101101979. The next prime is 1011101102003. The reversal of 1011101102001 is 1002011011101.
It is not a de Polignac number, because 1011101102001 - 215 = 1011101069233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1011101102003) 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, 18724094455 + ... + 18724094508.
It is an arithmetic number, because the mean of its divisors is an integer number (187240944820).
Almost surely, 21011101102001 is an apocalyptic number.
It is an amenable number.
1011101102001 is a deficient number, since it is larger than the sum of its proper divisors (486826456559).
1011101102001 is an equidigital number, since it uses as much as digits as its factorization.
1011101102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37448188972 (or 37448188966 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011101102001 its reverse (1002011011101), we get a palindrome (2013112113102).
The spelling of 1011101102001 in words is "one trillion, eleven billion, one hundred one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •