Base | Representation |
---|---|
bin | 1110110101100100001111… |
… | …0100000110100100111111 |
3 | 2010202112210112102102001022 |
4 | 3231121003310012210333 |
5 | 4114234342410201421 |
6 | 54410141105534355 |
7 | 3302414562006122 |
oct | 355310364064477 |
9 | 63675715372038 |
10 | 16313423522111 |
11 | 521a5363195a1 |
12 | 19b57986443bb |
13 | 9144703747c1 |
14 | 405806b543b9 |
15 | 1d4539c997ab |
hex | ed643d0693f |
16313423522111 has 8 divisors (see below), whose sum is σ = 16454207107920. Its totient is φ = 16172954538048.
The previous prime is 16313423522101. The next prime is 16313423522117. The reversal of 16313423522111 is 11122532431361.
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 16313423522111 - 26 = 16313423522047 is a prime.
It is a super-2 number, since 2×163134235221112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16313423522117) 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, 78546281 + ... + 78753698.
It is an arithmetic number, because the mean of its divisors is an integer number (2056775888490).
Almost surely, 216313423522111 is an apocalyptic number.
16313423522111 is a deficient number, since it is larger than the sum of its proper divisors (140783585809).
16313423522111 is a wasteful number, since it uses less digits than its factorization.
16313423522111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157300873.
The product of its digits is 25920, while the sum is 35.
Adding to 16313423522111 its reverse (11122532431361), we get a palindrome (27435955953472).
The spelling of 16313423522111 in words is "sixteen trillion, three hundred thirteen billion, four hundred twenty-three million, five hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •