Base | Representation |
---|---|
bin | 1011110010111010001… |
… | …11110000101011110000 |
3 | 1102202010022012200001210 |
4 | 11321131013300223300 |
5 | 23120013021210303 |
6 | 510104243000120 |
7 | 41165305465446 |
oct | 5713507605360 |
9 | 1382108180053 |
10 | 405289241328 |
11 | 146978235724 |
12 | 6666a669040 |
13 | 2c2ac39ba3a |
14 | 1588a836b96 |
15 | a820e36203 |
hex | 5e5d1f0af0 |
405289241328 has 20 divisors (see below), whose sum is σ = 1046997206888. Its totient is φ = 135096413760.
The previous prime is 405289241317. The next prime is 405289241339. The reversal of 405289241328 is 823142982504.
It is an interprime number because it is at equal distance from previous prime (405289241317) and next prime (405289241339).
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 8443525861 = 405289241328 / (4 + 0 + 5 + 2 + 8 + 9 + 2 + 4 + 1 + 3 + 2 + 8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4221762883 + ... + 4221762978.
Almost surely, 2405289241328 is an apocalyptic number.
405289241328 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
405289241328 is an abundant number, since it is smaller than the sum of its proper divisors (641707965560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405289241328 is a wasteful number, since it uses less digits than its factorization.
405289241328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8443525872 (or 8443525866 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 48.
The spelling of 405289241328 in words is "four hundred five billion, two hundred eighty-nine million, two hundred forty-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •