Base | Representation |
---|---|
bin | 1110110010001100010100… |
… | …0110010110001110111111 |
3 | 2010120000012011112000022110 |
4 | 3230203011012112032333 |
5 | 4112312142013223201 |
6 | 54323353455145103 |
7 | 3265263345623553 |
oct | 354430506261677 |
9 | 63500164460273 |
10 | 16255463023551 |
11 | 51a79a3109114 |
12 | 19a6501815193 |
13 | 90bb643125cb |
14 | 402aa90bd863 |
15 | 1d2c9660d6d6 |
hex | ec8c51963bf |
16255463023551 has 8 divisors (see below), whose sum is σ = 21888544269744. Its totient is φ = 10729678563200.
The previous prime is 16255463023523. The next prime is 16255463023571. The reversal of 16255463023551 is 15532036455261.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16255463023551 - 26 = 16255463023487 is a prime.
It is a super-2 number, since 2×162554630235512 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16255463023551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16255463023571) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26824196106 + ... + 26824196711.
It is an arithmetic number, because the mean of its divisors is an integer number (2736068033718).
Almost surely, 216255463023551 is an apocalyptic number.
16255463023551 is a deficient number, since it is larger than the sum of its proper divisors (5633081246193).
16255463023551 is a wasteful number, since it uses less digits than its factorization.
16255463023551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53648392921.
The product of its (nonzero) digits is 3240000, while the sum is 48.
The spelling of 16255463023551 in words is "sixteen trillion, two hundred fifty-five billion, four hundred sixty-three million, twenty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •