Base | Representation |
---|---|
bin | 1110100101101010111001… |
… | …0111110111100101000101 |
3 | 2002210102220102010120212102 |
4 | 3221122232113313211011 |
5 | 4100301100321011223 |
6 | 54040454420201445 |
7 | 3243606262034435 |
oct | 351325627674505 |
9 | 62712812116772 |
10 | 16040333375813 |
11 | 512473802470a |
12 | 1970883239285 |
13 | 8c479b653066 |
14 | 3d64db8aa2c5 |
15 | 1cc3a4cb5928 |
hex | e96ae5f7945 |
16040333375813 has 4 divisors (see below), whose sum is σ = 16052874685440. Its totient is φ = 16027792066188.
The previous prime is 16040333375767. The next prime is 16040333375831. The reversal of 16040333375813 is 31857333304061.
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 a cyclic number.
It is not a de Polignac number, because 16040333375813 - 214 = 16040333359429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16040333371813) 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, 6270652895 + ... + 6270655452.
It is an arithmetic number, because the mean of its divisors is an integer number (4013218671360).
Almost surely, 216040333375813 is an apocalyptic number.
It is an amenable number.
16040333375813 is a deficient number, since it is larger than the sum of its proper divisors (12541309627).
16040333375813 is a wasteful number, since it uses less digits than its factorization.
16040333375813 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12541309626.
The product of its (nonzero) digits is 1632960, while the sum is 47.
Adding to 16040333375813 its reverse (31857333304061), we get a palindrome (47897666679874).
The spelling of 16040333375813 in words is "sixteen trillion, forty billion, three hundred thirty-three million, three hundred seventy-five thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •