Base | Representation |
---|---|
bin | 11100110010001100… |
… | …00010111001000000 |
3 | 1110212222022002102212 |
4 | 32121012002321000 |
5 | 223122032310030 |
6 | 11033232001252 |
7 | 1054643511116 |
oct | 163106027100 |
9 | 43788262385 |
10 | 15453400640 |
11 | 6610050697 |
12 | 2bb3390228 |
13 | 15c3766862 |
14 | a68529ab6 |
15 | 606a25595 |
hex | 399182e40 |
15453400640 has 56 divisors (see below), whose sum is σ = 37088259072. Its totient is φ = 6132672000.
The previous prime is 15453400637. The next prime is 15453400643. The reversal of 15453400640 is 4600435451.
It is an interprime number because it is at equal distance from previous prime (15453400637) and next prime (15453400643).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 15453400597 and 15453400606.
It is not an unprimeable number, because it can be changed into a prime (15453400643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149486 + ... + 230765.
Almost surely, 215453400640 is an apocalyptic number.
15453400640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
15453400640 is an abundant number, since it is smaller than the sum of its proper divisors (21634858432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15453400640 is a wasteful number, since it uses less digits than its factorization.
15453400640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380395 (or 380385 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
The spelling of 15453400640 in words is "fifteen billion, four hundred fifty-three million, four hundred thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •