Base | Representation |
---|---|
bin | 10100100001000000… |
… | …01000011001111011 |
3 | 1001102121022020020020 |
4 | 22100200020121323 |
5 | 140024123323411 |
6 | 5020534101523 |
7 | 536641543653 |
oct | 122040103173 |
9 | 31377266206 |
10 | 11014276731 |
11 | 47422aa147 |
12 | 21747aa8a3 |
13 | 1066b85a13 |
14 | 766b49363 |
15 | 446e5e606 |
hex | 29080867b |
11014276731 has 24 divisors (see below), whose sum is σ = 15363640656. Its totient is φ = 7018260480.
The previous prime is 11014276723. The next prime is 11014276769. The reversal of 11014276731 is 13767241011.
It is a happy number.
It is not a de Polignac number, because 11014276731 - 23 = 11014276723 is a prime.
It is a super-2 number, since 2×110142767312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11014276692 and 11014276701.
It is not an unprimeable number, because it can be changed into a prime (11014276771) 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, 3999451 + ... + 4002203.
It is an arithmetic number, because the mean of its divisors is an integer number (640151694).
Almost surely, 211014276731 is an apocalyptic number.
11014276731 is a deficient number, since it is larger than the sum of its proper divisors (4349363925).
11014276731 is a wasteful number, since it uses less digits than its factorization.
11014276731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5323 (or 5300 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 33.
The spelling of 11014276731 in words is "eleven billion, fourteen million, two hundred seventy-six thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •