Base | Representation |
---|---|
bin | 10100100001000010… |
… | …00101010100011000 |
3 | 1001102121202220111000 |
4 | 22100201011110120 |
5 | 140024204314412 |
6 | 5020543305000 |
7 | 536643633243 |
oct | 122041052430 |
9 | 31377686430 |
10 | 11014526232 |
11 | 474245a646 |
12 | 21748ab160 |
13 | 1066c42458 |
14 | 766bb225a |
15 | 446ead4dc |
hex | 290845518 |
11014526232 has 32 divisors (see below), whose sum is σ = 30595906800. Its totient is φ = 3671508672.
The previous prime is 11014526227. The next prime is 11014526251. The reversal of 11014526232 is 23262541011.
11014526232 is a `hidden beast` number, since 1 + 101 + 4 + 526 + 2 + 32 = 666.
It is a super-2 number, since 2×110145262322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11014526196 and 11014526205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25496373 + ... + 25496804.
Almost surely, 211014526232 is an apocalyptic number.
11014526232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11014526232 is an abundant number, since it is smaller than the sum of its proper divisors (19581380568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014526232 is a wasteful number, since it uses less digits than its factorization.
11014526232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50993192 (or 50993182 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 11014526232 in words is "eleven billion, fourteen million, five hundred twenty-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •