Base | Representation |
---|---|
bin | 1110101100101101000000… |
… | …1101101111110010111011 |
3 | 2010012222210001011211222122 |
4 | 3223023100031233302323 |
5 | 4104241024004411443 |
6 | 54212200131111455 |
7 | 3255414421256564 |
oct | 353132015576273 |
9 | 63188701154878 |
10 | 16161160232123 |
11 | 5170a006a3155 |
12 | 1990183a4258b |
13 | 902cb5c343ca |
14 | 3dc2c096d16b |
15 | 1d05c764a968 |
hex | eb2d036fcbb |
16161160232123 has 4 divisors (see below), whose sum is σ = 16355873006088. Its totient is φ = 15966447458160.
The previous prime is 16161160232101. The next prime is 16161160232143. The reversal of 16161160232123 is 32123206116161.
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 16161160232123 - 242 = 11763113721019 is a prime.
It is a super-2 number, since 2×161611602321232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16161160232143) 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, 97356386858 + ... + 97356387023.
It is an arithmetic number, because the mean of its divisors is an integer number (4088968251522).
Almost surely, 216161160232123 is an apocalyptic number.
16161160232123 is a deficient number, since it is larger than the sum of its proper divisors (194712773965).
16161160232123 is an equidigital number, since it uses as much as digits as its factorization.
16161160232123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194712773964.
The product of its (nonzero) digits is 15552, while the sum is 35.
Adding to 16161160232123 its reverse (32123206116161), we get a palindrome (48284366348284).
The spelling of 16161160232123 in words is "sixteen trillion, one hundred sixty-one billion, one hundred sixty million, two hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •