Base | Representation |
---|---|
bin | 10101011001001100… |
… | …01000100000000000 |
3 | 1002122110012112201020 |
4 | 22230212020200000 |
5 | 142010304041112 |
6 | 5135412305440 |
7 | 554424043236 |
oct | 125446104000 |
9 | 32573175636 |
10 | 11485612032 |
11 | 4964368354 |
12 | 2286612280 |
13 | 111071284b |
14 | 7ad59c956 |
15 | 47351448c |
hex | 2ac988800 |
11485612032 has 48 divisors (see below), whose sum is σ = 30620837520. Its totient is φ = 3828535296.
The previous prime is 11485612027. The next prime is 11485612037. The reversal of 11485612032 is 23021658411.
It is an interprime number because it is at equal distance from previous prime (11485612027) and next prime (11485612037).
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 11485611984 and 11485612002.
It is not an unprimeable number, because it can be changed into a prime (11485612037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 928558 + ... + 940845.
It is an arithmetic number, because the mean of its divisors is an integer number (637934115).
Almost surely, 211485612032 is an apocalyptic number.
11485612032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11485612032 is an abundant number, since it is smaller than the sum of its proper divisors (19135225488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11485612032 is an equidigital number, since it uses as much as digits as its factorization.
11485612032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1869428 (or 1869408 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 33.
The spelling of 11485612032 in words is "eleven billion, four hundred eighty-five million, six hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •