Base | Representation |
---|---|
bin | 11100111101110010… |
… | …00000001100011011 |
3 | 1111010202021121122112 |
4 | 32132321000030123 |
5 | 223321431120034 |
6 | 11051024142535 |
7 | 1060234205330 |
oct | 163671001433 |
9 | 44122247575 |
10 | 15550645019 |
11 | 665aa2a848 |
12 | 301ba67a4b |
13 | 160a954000 |
14 | a77400987 |
15 | 6103337ce |
hex | 39ee4031b |
15550645019 has 48 divisors (see below), whose sum is σ = 20326380480. Its totient is φ = 11652076800.
The previous prime is 15550645007. The next prime is 15550645021. The reversal of 15550645019 is 91054605551.
15550645019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15550645019 - 228 = 15282209563 is a prime.
It is a super-2 number, since 2×155506450192 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15550645049) 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 47 ways as a sum of consecutive naturals, for example, 5550419 + ... + 5553219.
It is an arithmetic number, because the mean of its divisors is an integer number (423466260).
Almost surely, 215550645019 is an apocalyptic number.
15550645019 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
15550645019 is a deficient number, since it is larger than the sum of its proper divisors (4775735461).
15550645019 is an equidigital number, since it uses as much as digits as its factorization.
15550645019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2885 (or 2840 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 41.
The spelling of 15550645019 in words is "fifteen billion, five hundred fifty million, six hundred forty-five thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •