Base | Representation |
---|---|
bin | 1000100000000110111011… |
… | …01111111100011010001011 |
3 | 2110012021010211021121002221 |
4 | 10100003131233330122023 |
5 | 4422301204002131011 |
6 | 103432320110234511 |
7 | 3636461613024460 |
oct | 420033557743213 |
9 | 73167124247087 |
10 | 18695418005131 |
11 | 5a5875609132a |
12 | 211b3697b5a37 |
13 | a57c7cb3473a |
14 | 488c12341667 |
15 | 22649da77971 |
hex | 1100ddbfc68b |
18695418005131 has 8 divisors (see below), whose sum is σ = 21820791836160. Its totient is φ = 15683694131688.
The previous prime is 18695418005081. The next prime is 18695418005183. The reversal of 18695418005131 is 13150081459681.
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 18695418005131 - 211 = 18695418003083 is a prime.
It is a super-2 number, since 2×186954180051312 (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 (18695418005531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28412489041 + ... + 28412489698.
It is an arithmetic number, because the mean of its divisors is an integer number (2727598979520).
Almost surely, 218695418005131 is an apocalyptic number.
18695418005131 is a deficient number, since it is larger than the sum of its proper divisors (3125373831029).
18695418005131 is an equidigital number, since it uses as much as digits as its factorization.
18695418005131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56824978793.
The product of its (nonzero) digits is 1036800, while the sum is 52.
The spelling of 18695418005131 in words is "eighteen trillion, six hundred ninety-five billion, four hundred eighteen million, five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •