Base | Representation |
---|---|
bin | 1110111010100110110101… |
… | …0111101011110001110111 |
3 | 2011001211022121002101122122 |
4 | 3232221231113223301313 |
5 | 4122144220113430203 |
6 | 54514022030150155 |
7 | 3311601533312324 |
oct | 356515527536167 |
9 | 64054277071578 |
10 | 16400020061303 |
11 | 525323386015a |
12 | 1a0a52565235b |
13 | 91c69102b938 |
14 | 409a9da23b4b |
15 | 1d6907438538 |
hex | eea6d5ebc77 |
16400020061303 has 16 divisors (see below), whose sum is σ = 17095689861120. Its totient is φ = 15720805274400.
The previous prime is 16400020061291. The next prime is 16400020061309. The reversal of 16400020061303 is 30316002000461.
It is a cyclic number.
It is not a de Polignac number, because 16400020061303 - 222 = 16400015866999 is a prime.
It is a super-2 number, since 2×164000200613032 (a number of 27 digits) 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 (16400020061309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10160288 + ... + 11663253.
It is an arithmetic number, because the mean of its divisors is an integer number (1068480616320).
Almost surely, 216400020061303 is an apocalyptic number.
16400020061303 is a deficient number, since it is larger than the sum of its proper divisors (695669799817).
16400020061303 is a wasteful number, since it uses less digits than its factorization.
16400020061303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21823918.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 16400020061303 its reverse (30316002000461), we get a palindrome (46716022061764).
The spelling of 16400020061303 in words is "sixteen trillion, four hundred billion, twenty million, sixty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •