Base | Representation |
---|---|
bin | 1011110100011011000… |
… | …10100110000100101001 |
3 | 1102211012220202212010211 |
4 | 11322031202212010221 |
5 | 23123144001111441 |
6 | 510321022141121 |
7 | 41224401331114 |
oct | 5721542460451 |
9 | 1384186685124 |
10 | 406101582121 |
11 | 147254835354 |
12 | 668567217a1 |
13 | 2c3ab782a71 |
14 | 1592669557b |
15 | a86c3e9a81 |
hex | 5e8d8a6129 |
406101582121 has 27 divisors (see below), whose sum is σ = 430287034359. Its totient is φ = 383243667312.
The previous prime is 406101582113. The next prime is 406101582149. The reversal of 406101582121 is 121285101604.
The square root of 406101582121 is 637261.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 26719498521 + 379382083600 = 163461^2 + 615940^2 .
It is not a de Polignac number, because 406101582121 - 23 = 406101582113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (406101582191) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1509671175 + ... + 1509671443.
Almost surely, 2406101582121 is an apocalyptic number.
406101582121 is the 637261-st square number.
406101582121 is the 318631-st centered octagonal number.
It is an amenable number.
406101582121 is a deficient number, since it is larger than the sum of its proper divisors (24185452238).
406101582121 is an frugal number, since it uses more digits than its factorization.
406101582121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 790 (or 395 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 31.
Adding to 406101582121 its reverse (121285101604), we get a palindrome (527386683725).
The spelling of 406101582121 in words is "four hundred six billion, one hundred one million, five hundred eighty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •