Base | Representation |
---|---|
bin | 10100100000100110… |
… | …11110111001101001 |
3 | 1001102101001202220102 |
4 | 22100103132321221 |
5 | 140022301223001 |
6 | 5020335035145 |
7 | 536601424055 |
oct | 122023367151 |
9 | 31371052812 |
10 | 11010961001 |
11 | 4740444a77 |
12 | 217366bab5 |
13 | 1066294751 |
14 | 766524c65 |
15 | 446a06e6b |
hex | 2904dee69 |
11010961001 has 2 divisors, whose sum is σ = 11010961002. Its totient is φ = 11010961000.
The previous prime is 11010960949. The next prime is 11010961009. The reversal of 11010961001 is 10016901011.
11010961001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9134771776 + 1876189225 = 95576^2 + 43315^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010961001 - 218 = 11010698857 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010961009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505480500 + 5505480501.
It is an arithmetic number, because the mean of its divisors is an integer number (5505480501).
Almost surely, 211010961001 is an apocalyptic number.
It is an amenable number.
11010961001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010961001 is an equidigital number, since it uses as much as digits as its factorization.
11010961001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 11010961001 in words is "eleven billion, ten million, nine hundred sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •