Base | Representation |
---|---|
bin | 1110111000011010100100… |
… | …0011011100110101000001 |
3 | 2010221020010110121122222201 |
4 | 3232012221003130311001 |
5 | 4121040111332400411 |
6 | 54444433435433201 |
7 | 3306066462014446 |
oct | 356065103346501 |
9 | 63836113548881 |
10 | 16362366684481 |
11 | 5239271477914 |
12 | 1a031775b5801 |
13 | 918c701968cc |
14 | 407d2ad7d9cd |
15 | 1d59519823c1 |
hex | ee1a90dcd41 |
16362366684481 has 2 divisors, whose sum is σ = 16362366684482. Its totient is φ = 16362366684480.
The previous prime is 16362366684463. The next prime is 16362366684491. The reversal of 16362366684481 is 18448666326361.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8444783692081 + 7917582992400 = 2905991^2 + 2813820^2 .
It is an emirp because it is prime and its reverse (18448666326361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16362366684481 - 211 = 16362366682433 is a prime.
It is a super-2 number, since 2×163623666844812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16362366684491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8181183342240 + 8181183342241.
It is an arithmetic number, because the mean of its divisors is an integer number (8181183342241).
Almost surely, 216362366684481 is an apocalyptic number.
It is an amenable number.
16362366684481 is a deficient number, since it is larger than the sum of its proper divisors (1).
16362366684481 is an equidigital number, since it uses as much as digits as its factorization.
16362366684481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 143327232, while the sum is 64.
The spelling of 16362366684481 in words is "sixteen trillion, three hundred sixty-two billion, three hundred sixty-six million, six hundred eighty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •