Base | Representation |
---|---|
bin | 10101001000011111… |
… | …10011101101110010 |
3 | 1002021200122020202100 |
4 | 22210033303231302 |
5 | 141213424321002 |
6 | 5113450201230 |
7 | 551103341634 |
oct | 124417635562 |
9 | 32250566670 |
10 | 11345542002 |
11 | 48a22986a3 |
12 | 2247723216 |
13 | 10ba6ac682 |
14 | 798b3aa54 |
15 | 46609711c |
hex | 2a43f3b72 |
11345542002 has 48 divisors (see below), whose sum is σ = 25173802368. Its totient is φ = 3690943200.
The previous prime is 11345542001. The next prime is 11345542003. The reversal of 11345542002 is 20024554311.
11345542002 is a `hidden beast` number, since 1 + 1 + 3 + 455 + 4 + 200 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (11345542001) and next prime (11345542003).
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (11345542001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1096252 + ... + 1106552.
It is an arithmetic number, because the mean of its divisors is an integer number (524454216).
Almost surely, 211345542002 is an apocalyptic number.
11345542002 is an abundant number, since it is smaller than the sum of its proper divisors (13828260366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11345542002 is a wasteful number, since it uses less digits than its factorization.
11345542002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11775 (or 11772 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 11345542002 in words is "eleven billion, three hundred forty-five million, five hundred forty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •