Base | Representation |
---|---|
bin | 1011110010011000011… |
… | …11011110111110001001 |
3 | 1102201101120100020001201 |
4 | 11321030033132332021 |
5 | 23113423022201012 |
6 | 510020205144201 |
7 | 41155266436321 |
oct | 5711417367611 |
9 | 1381346306051 |
10 | 405006053257 |
11 | 1468423a42a3 |
12 | 665ab85b061 |
13 | 2c265809230 |
14 | 15860d9c281 |
15 | a806148857 |
hex | 5e4c3def89 |
405006053257 has 8 divisors (see below), whose sum is σ = 437259011336. Its totient is φ = 372910044672.
The previous prime is 405006053227. The next prime is 405006053267. The reversal of 405006053257 is 752350600504.
It can be written as a sum of positive squares in 4 ways, for example, as 13110021001 + 391896032256 = 114499^2 + 626016^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 405006053257 - 27 = 405006053129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (405006053227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39232008 + ... + 39242329.
It is an arithmetic number, because the mean of its divisors is an integer number (54657376417).
Almost surely, 2405006053257 is an apocalyptic number.
It is an amenable number.
405006053257 is a deficient number, since it is larger than the sum of its proper divisors (32252958079).
405006053257 is a wasteful number, since it uses less digits than its factorization.
405006053257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78474747.
The product of its (nonzero) digits is 126000, while the sum is 37.
The spelling of 405006053257 in words is "four hundred five billion, six million, fifty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •