Base | Representation |
---|---|
bin | 10100100000110111… |
… | …01001110110100101 |
3 | 1001102112002121012012 |
4 | 22100123221312211 |
5 | 140023323244023 |
6 | 5020453004005 |
7 | 536625555023 |
oct | 122033516645 |
9 | 31375077165 |
10 | 11013103013 |
11 | 4741678330 |
12 | 2174323605 |
13 | 1066864703 |
14 | 766921713 |
15 | 446ccb978 |
hex | 2906e9da5 |
11013103013 has 16 divisors (see below), whose sum is σ = 12791338560. Its totient is φ = 9370886400.
The previous prime is 11013103001. The next prime is 11013103033. The reversal of 11013103013 is 31030131011.
It is a happy number.
11013103013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11013103013 - 28 = 11013102757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013103033) 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 in 15 ways as a sum of consecutive naturals, for example, 128843 + ... + 196536.
It is an arithmetic number, because the mean of its divisors is an integer number (799458660).
Almost surely, 211013103013 is an apocalyptic number.
It is an amenable number.
11013103013 is a deficient number, since it is larger than the sum of its proper divisors (1778235547).
11013103013 is a wasteful number, since it uses less digits than its factorization.
11013103013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325588.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 11013103013 its reverse (31030131011), we get a palindrome (42043234024).
The spelling of 11013103013 in words is "eleven billion, thirteen million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •