Base | Representation |
---|---|
bin | 10101000001011010… |
… | …01010000110111010 |
3 | 1002010112211122201222 |
4 | 22200231022012322 |
5 | 141103222031114 |
6 | 5103524512042 |
7 | 546452332310 |
oct | 124055120672 |
9 | 32115748658 |
10 | 11286127034 |
11 | 48717a7316 |
12 | 222b84b622 |
13 | 10ab2a8aa0 |
14 | 790cb20b0 |
15 | 460c5c98e |
hex | 2a0b4a1ba |
11286127034 has 128 divisors (see below), whose sum is σ = 22845849600. Its totient is φ = 4056272640.
The previous prime is 11286127007. The next prime is 11286127037. The reversal of 11286127034 is 43072168211.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11286126985 and 11286127003.
It is not an unprimeable number, because it can be changed into a prime (11286127037) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13613732 + ... + 13614560.
It is an arithmetic number, because the mean of its divisors is an integer number (178483200).
Almost surely, 211286127034 is an apocalyptic number.
11286127034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11286127034 is an abundant number, since it is smaller than the sum of its proper divisors (11559722566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11286127034 is a wasteful number, since it uses less digits than its factorization.
11286127034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1028.
The product of its (nonzero) digits is 16128, while the sum is 35.
The spelling of 11286127034 in words is "eleven billion, two hundred eighty-six million, one hundred twenty-seven thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •