Base | Representation |
---|---|
bin | 10100100000111110… |
… | …11110100101000101 |
3 | 1001102120222112020010 |
4 | 22100133132211011 |
5 | 140024102333123 |
6 | 5020530300433 |
7 | 536640231333 |
oct | 122037364505 |
9 | 31376875203 |
10 | 11014105413 |
11 | 47421a2463 |
12 | 2174727719 |
13 | 1066b25a4c |
14 | 766b02b53 |
15 | 446e28993 |
hex | 2907de945 |
11014105413 has 16 divisors (see below), whose sum is σ = 15161985536. Its totient is φ = 7104568320.
The previous prime is 11014105369. The next prime is 11014105423. The reversal of 11014105413 is 31450141011.
11014105413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11014105413 - 213 = 11014097221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11014105413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014105423) 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, 985545 + ... + 996657.
It is an arithmetic number, because the mean of its divisors is an integer number (947624096).
Almost surely, 211014105413 is an apocalyptic number.
It is an amenable number.
11014105413 is a deficient number, since it is larger than the sum of its proper divisors (4147880123).
11014105413 is a wasteful number, since it uses less digits than its factorization.
11014105413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21804.
The product of its (nonzero) digits is 240, while the sum is 21.
Adding to 11014105413 its reverse (31450141011), we get a palindrome (42464246424).
The spelling of 11014105413 in words is "eleven billion, fourteen million, one hundred five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •