Base | Representation |
---|---|
bin | 10100100000111010… |
… | …11000100111111100 |
3 | 1001102112221122120121 |
4 | 22100131120213330 |
5 | 140023432303412 |
6 | 5020510424324 |
7 | 536632454563 |
oct | 122035304774 |
9 | 31375848517 |
10 | 11013556732 |
11 | 4741958202 |
12 | 21745020a4 |
13 | 1066993099 |
14 | 7669dcbda |
15 | 446d6b107 |
hex | 2907589fc |
11013556732 has 12 divisors (see below), whose sum is σ = 19276910856. Its totient is φ = 5505867920.
The previous prime is 11013556691. The next prime is 11013556733. The reversal of 11013556732 is 23765531011.
11013556732 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×110135567323 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013556733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 200023 + ... + 249070.
It is an arithmetic number, because the mean of its divisors is an integer number (1606409238).
Almost surely, 211013556732 is an apocalyptic number.
It is an amenable number.
11013556732 is a deficient number, since it is larger than the sum of its proper divisors (8263354124).
11013556732 is a wasteful number, since it uses less digits than its factorization.
11013556732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455228 (or 455226 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 34.
The spelling of 11013556732 in words is "eleven billion, thirteen million, five hundred fifty-six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •