Base | Representation |
---|---|
bin | 11011111100110001… |
… | …00000010111100100 |
3 | 1102201202000221101101 |
4 | 31332120200113210 |
5 | 221212321131030 |
6 | 10520542405444 |
7 | 1040562364351 |
oct | 157630402744 |
9 | 42652027341 |
10 | 15005255140 |
11 | 6400091307 |
12 | 2aa9290884 |
13 | 1551968cc5 |
14 | a24bd1628 |
15 | 5cc5017ca |
hex | 37e6205e4 |
15005255140 has 24 divisors (see below), whose sum is σ = 31704361920. Its totient is φ = 5965278048.
The previous prime is 15005255123. The next prime is 15005255141. The reversal of 15005255140 is 4155250051.
15005255140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 15005255099 and 15005255108.
It is not an unprimeable number, because it can be changed into a prime (15005255141) 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, 2298160 + ... + 2304679.
It is an arithmetic number, because the mean of its divisors is an integer number (1321015080).
Almost surely, 215005255140 is an apocalyptic number.
15005255140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
15005255140 is an abundant number, since it is smaller than the sum of its proper divisors (16699106780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15005255140 is a wasteful number, since it uses less digits than its factorization.
15005255140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4603011 (or 4603009 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 28.
The spelling of 15005255140 in words is "fifteen billion, five million, two hundred fifty-five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •