Base | Representation |
---|---|
bin | 110000001010100… |
… | …0000101001010001 |
3 | 11011122000102102011 |
4 | 1200111000221101 |
5 | 11302211323101 |
6 | 424211022521 |
7 | 55022540200 |
oct | 14025005121 |
9 | 4148012364 |
10 | 1616120401 |
11 | 75a2921a5 |
12 | 39129aa41 |
13 | 1c9a8b37c |
14 | 1148cd237 |
15 | 96d35751 |
hex | 60540a51 |
1616120401 has 9 divisors (see below), whose sum is σ = 1880304201. Its totient is φ = 1385004852.
The previous prime is 1616120393. The next prime is 1616120423. The reversal of 1616120401 is 1040216161.
The square root of 1616120401 is 40201.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 1616120401 - 23 = 1616120393 is a prime.
It is a super-2 number, since 2×16161204012 = 5223690301056801602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1616150401) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 278536 + ... + 284278.
It is an arithmetic number, because the mean of its divisors is an integer number (208922689).
Almost surely, 21616120401 is an apocalyptic number.
1616120401 is the 40201-st square number.
1616120401 is the 20101-st centered octagonal number.
It is an amenable number.
1616120401 is a deficient number, since it is larger than the sum of its proper divisors (264183800).
1616120401 is an frugal number, since it uses more digits than its factorization.
1616120401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11500 (or 5750 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
The cubic root of 1616120401 is about 1173.5220048827.
Adding to 1616120401 its reverse (1040216161), we get a palindrome (2656336562).
The spelling of 1616120401 in words is "one billion, six hundred sixteen million, one hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.589 sec. • engine limits •