Base | Representation |
---|---|
bin | 1110111110001010000011… |
… | …1000000000001000000101 |
3 | 2011021122202100101221211212 |
4 | 3233202200320000020011 |
5 | 4124144124002312123 |
6 | 55002030231541205 |
7 | 3316161156642053 |
oct | 357424070001005 |
9 | 64248670357755 |
10 | 16461013713413 |
11 | 5277093115805 |
12 | 1a1a30822a805 |
13 | 9253615b2849 |
14 | 40ca084511d3 |
15 | 1d82c7016878 |
hex | ef8a0e00205 |
16461013713413 has 2 divisors, whose sum is σ = 16461013713414. Its totient is φ = 16461013713412.
The previous prime is 16461013713401. The next prime is 16461013713421. The reversal of 16461013713413 is 31431731016461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16461009785089 + 3928324 = 4057217^2 + 1982^2 .
It is a cyclic number.
It is not a de Polignac number, because 16461013713413 - 26 = 16461013713349 is a prime.
It is a super-2 number, since 2×164610137134132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16461013743413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8230506856706 + 8230506856707.
It is an arithmetic number, because the mean of its divisors is an integer number (8230506856707).
Almost surely, 216461013713413 is an apocalyptic number.
It is an amenable number.
16461013713413 is a deficient number, since it is larger than the sum of its proper divisors (1).
16461013713413 is an equidigital number, since it uses as much as digits as its factorization.
16461013713413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108864, while the sum is 41.
Adding to 16461013713413 its reverse (31431731016461), we get a palindrome (47892744729874).
The spelling of 16461013713413 in words is "sixteen trillion, four hundred sixty-one billion, thirteen million, seven hundred thirteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •