Base | Representation |
---|---|
bin | 100110111011110… |
… | …0001010100111101 |
3 | 10101001012222222110 |
4 | 1031313201110331 |
5 | 10133414300221 |
6 | 333344404233 |
7 | 44242134351 |
oct | 11567412475 |
9 | 3331188873 |
10 | 1306400061 |
11 | 61047977a |
12 | 305616679 |
13 | 17a8690b5 |
14 | c5709461 |
15 | 79a56776 |
hex | 4dde153d |
1306400061 has 4 divisors (see below), whose sum is σ = 1741866752. Its totient is φ = 870933372.
The previous prime is 1306400057. The next prime is 1306400077. The reversal of 1306400061 is 1600046031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1306400061 - 22 = 1306400057 is a prime.
It is a super-2 number, since 2×13064000612 = 3413362238761607442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1306404061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 217733341 + ... + 217733346.
It is an arithmetic number, because the mean of its divisors is an integer number (435466688).
Almost surely, 21306400061 is an apocalyptic number.
It is an amenable number.
1306400061 is a deficient number, since it is larger than the sum of its proper divisors (435466691).
1306400061 is an equidigital number, since it uses as much as digits as its factorization.
1306400061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435466690.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 1306400061 is about 36144.1566646671. The cubic root of 1306400061 is about 1093.1809727106.
Adding to 1306400061 its reverse (1600046031), we get a palindrome (2906446092).
The spelling of 1306400061 in words is "one billion, three hundred six million, four hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •