Base | Representation |
---|---|
bin | 11100111110000110… |
… | …00110000001111100 |
3 | 1111010221021000101021 |
4 | 32133003012001330 |
5 | 223323120242424 |
6 | 11051200553524 |
7 | 1060265533603 |
oct | 163703060174 |
9 | 44127230337 |
10 | 15553290364 |
11 | 6661477287 |
12 | 30209228a4 |
13 | 160b36c0c1 |
14 | a778cca3a |
15 | 6106a74e4 |
hex | 39f0c607c |
15553290364 has 24 divisors (see below), whose sum is σ = 28101298176. Its totient is φ = 7524438000.
The previous prime is 15553290359. The next prime is 15553290367. The reversal of 15553290364 is 46309235551.
15553290364 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-2 number, since 2×155532903642 (a number of 21 digits) contains 22 as substring.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 15553290364.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15553290367) 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 7 ways as a sum of consecutive naturals, for example, 1282449 + ... + 1294519.
It is an arithmetic number, because the mean of its divisors is an integer number (1170887424).
Almost surely, 215553290364 is an apocalyptic number.
It is an amenable number.
15553290364 is a deficient number, since it is larger than the sum of its proper divisors (12548007812).
15553290364 is a wasteful number, since it uses less digits than its factorization.
15553290364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22497 (or 22495 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 43.
The spelling of 15553290364 in words is "fifteen billion, five hundred fifty-three million, two hundred ninety thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •