Base | Representation |
---|---|
bin | 11100000000111101… |
… | …10000111101100011 |
3 | 1102211012021001012122 |
4 | 32000132300331203 |
5 | 221300323403103 |
6 | 10524241014455 |
7 | 1041500501426 |
oct | 160036607543 |
9 | 42735231178 |
10 | 15040450403 |
11 | 6418a40000 |
12 | 2ab902442b |
13 | 155903c8c4 |
14 | a297539bd |
15 | 5d0654b38 |
hex | 3807b0f63 |
15040450403 has 20 divisors (see below), whose sum is σ = 16692639240. Its totient is φ = 13550644800.
The previous prime is 15040450393. The next prime is 15040450427. The reversal of 15040450403 is 30405404051.
15040450403 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 15040450403 - 26 = 15040450339 is a prime.
It is a hoax number, since the sum of its digits (26) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15040450463) 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 19 ways as a sum of consecutive naturals, for example, 1649888 + ... + 1658978.
It is an arithmetic number, because the mean of its divisors is an integer number (834631962).
Almost surely, 215040450403 is an apocalyptic number.
15040450403 is a deficient number, since it is larger than the sum of its proper divisors (1652188837).
15040450403 is an frugal number, since it uses more digits than its factorization.
15040450403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9248 (or 9215 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 15040450403 its reverse (30405404051), we get a palindrome (45445854454).
The spelling of 15040450403 in words is "fifteen billion, forty million, four hundred fifty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •