Base | Representation |
---|---|
bin | 1110110001111100011100… |
… | …0101010000110101110101 |
3 | 2010112121012011101100221012 |
4 | 3230133013011100311311 |
5 | 4112224430014421303 |
6 | 54321410540202005 |
7 | 3265052630036642 |
oct | 354370705206565 |
9 | 63477164340835 |
10 | 16251201326453 |
11 | 51a6106531aa5 |
12 | 19a5712539305 |
13 | 90b635414352 |
14 | 4027c30c6dc9 |
15 | 1d2ae73e35d8 |
hex | ec7c7150d75 |
16251201326453 has 16 divisors (see below), whose sum is σ = 16342775900160. Its totient is φ = 16159816008000.
The previous prime is 16251201326341. The next prime is 16251201326489. The reversal of 16251201326453 is 35462310215261.
It is a cyclic number.
It is not a de Polignac number, because 16251201326453 - 218 = 16251201064309 is a prime.
It is a super-2 number, since 2×162512013264532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16251201326453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16251201346453) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 954765083 + ... + 954782103.
It is an arithmetic number, because the mean of its divisors is an integer number (1021423493760).
Almost surely, 216251201326453 is an apocalyptic number.
It is an amenable number.
16251201326453 is a deficient number, since it is larger than the sum of its proper divisors (91574573707).
16251201326453 is a wasteful number, since it uses less digits than its factorization.
16251201326453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22268.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 16251201326453 in words is "sixteen trillion, two hundred fifty-one billion, two hundred one million, three hundred twenty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •