Base | Representation |
---|---|
bin | 1011110010100110111… |
… | …01011101100100000000 |
3 | 1102201201000012222120011 |
4 | 11321103131131210000 |
5 | 23114200023024031 |
6 | 510040212554304 |
7 | 41161300011400 |
oct | 5712335354400 |
9 | 1381630188504 |
10 | 405127158016 |
11 | 1468a47a0079 |
12 | 66624322994 |
13 | 2c28492bc59 |
14 | 158730c4800 |
15 | a811abb6b1 |
hex | 5e5375d900 |
405127158016 has 81 divisors (see below), whose sum is σ = 940865392971. Its totient is φ = 173595373056.
The previous prime is 405127158011. The next prime is 405127158041. The reversal of 405127158016 is 610851721504.
The square root of 405127158016 is 636496.
It is a perfect power (a square), and thus also a powerful number.
It is a self number, because there is not a number n which added to its sum of digits gives 405127158016.
It is not an unprimeable number, because it can be changed into a prime (405127158011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 71284711 + ... + 71290393.
Almost surely, 2405127158016 is an apocalyptic number.
405127158016 is the 636496-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 405127158016
405127158016 is an abundant number, since it is smaller than the sum of its proper divisors (535738234955).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405127158016 is an frugal number, since it uses more digits than its factorization.
405127158016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11396 (or 5692 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 40.
The spelling of 405127158016 in words is "four hundred five billion, one hundred twenty-seven million, one hundred fifty-eight thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •