Base | Representation |
---|---|
bin | 1110110111111100100000… |
… | …1111010110001000010001 |
3 | 2010220110022021122200212201 |
4 | 3231333020033112020101 |
5 | 4120422101242234443 |
6 | 54441021153523201 |
7 | 3305362541010646 |
oct | 355771017261021 |
9 | 63813267580781 |
10 | 16354299961873 |
11 | 5235901a77815 |
12 | 1a016a5b73501 |
13 | 918285b91973 |
14 | 4077a38a7dcd |
15 | 1d562d6a734d |
hex | edfc83d6211 |
16354299961873 has 2 divisors, whose sum is σ = 16354299961874. Its totient is φ = 16354299961872.
The previous prime is 16354299961861. The next prime is 16354299961903. The reversal of 16354299961873 is 37816999245361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13885401121344 + 2468898840529 = 3726312^2 + 1571273^2 .
It is a cyclic number.
It is not a de Polignac number, because 16354299961873 - 25 = 16354299961841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16354299961796 and 16354299961805.
It is not a weakly prime, because it can be changed into another prime (16354299961273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8177149980936 + 8177149980937.
It is an arithmetic number, because the mean of its divisors is an integer number (8177149980937).
Almost surely, 216354299961873 is an apocalyptic number.
It is an amenable number.
16354299961873 is a deficient number, since it is larger than the sum of its proper divisors (1).
16354299961873 is an equidigital number, since it uses as much as digits as its factorization.
16354299961873 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 529079040, while the sum is 73.
The spelling of 16354299961873 in words is "sixteen trillion, three hundred fifty-four billion, two hundred ninety-nine million, nine hundred sixty-one thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •