Base | Representation |
---|---|
bin | 10100100001000001… |
… | …00110110001100011 |
3 | 1001102121112112212100 |
4 | 22100200212301203 |
5 | 140024141313443 |
6 | 5020540501443 |
7 | 536642602425 |
oct | 122040466143 |
9 | 31377475770 |
10 | 11014401123 |
11 | 4742384650 |
12 | 217484a883 |
13 | 1066bca51b |
14 | 766b7c815 |
15 | 446e863d3 |
hex | 290826c63 |
11014401123 has 24 divisors (see below), whose sum is σ = 17359421040. Its totient is φ = 6674088960.
The previous prime is 11014401107. The next prime is 11014401131. The reversal of 11014401123 is 32110441011.
11014401123 is a `hidden beast` number, since 1 + 101 + 440 + 1 + 123 = 666.
It is not a de Polignac number, because 11014401123 - 24 = 11014401107 is a prime.
It is a super-2 number, since 2×110144011232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11014401096 and 11014401105.
It is not an unprimeable number, because it can be changed into a prime (11014401143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 805915 + ... + 819467.
It is an arithmetic number, because the mean of its divisors is an integer number (723309210).
Almost surely, 211014401123 is an apocalyptic number.
11014401123 is a deficient number, since it is larger than the sum of its proper divisors (6345019917).
11014401123 is a wasteful number, since it uses less digits than its factorization.
11014401123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21779 (or 21776 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 11014401123 its reverse (32110441011), we get a palindrome (43124842134).
The spelling of 11014401123 in words is "eleven billion, fourteen million, four hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •