Base | Representation |
---|---|
bin | 1110111000111100111111… |
… | …1000110011110011111011 |
3 | 2010222002222112001022010222 |
4 | 3232033033320303303323 |
5 | 4121213023141003201 |
6 | 54453002444130255 |
7 | 3306544466055512 |
oct | 356171770636373 |
9 | 63862875038128 |
10 | 16371608141051 |
11 | 5242183a96a29 |
12 | 1a04b1653698b |
13 | 919ab39879c7 |
14 | 408566489679 |
15 | 1d5ce2e5691b |
hex | ee3cfe33cfb |
16371608141051 has 4 divisors (see below), whose sum is σ = 17334643914072. Its totient is φ = 15408572368032.
The previous prime is 16371608140939. The next prime is 16371608141059. The reversal of 16371608141051 is 15014180617361.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16371608141051 - 214 = 16371608124667 is a prime.
It is a super-2 number, since 2×163716081410512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16371608140993 and 16371608141011.
It is not an unprimeable number, because it can be changed into a prime (16371608141059) 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, 481517886485 + ... + 481517886518.
It is an arithmetic number, because the mean of its divisors is an integer number (4333660978518).
Almost surely, 216371608141051 is an apocalyptic number.
16371608141051 is a deficient number, since it is larger than the sum of its proper divisors (963035773021).
16371608141051 is an equidigital number, since it uses as much as digits as its factorization.
16371608141051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 963035773020.
The product of its (nonzero) digits is 120960, while the sum is 44.
The spelling of 16371608141051 in words is "sixteen trillion, three hundred seventy-one billion, six hundred eight million, one hundred forty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •