Base | Representation |
---|---|
bin | 100110011001001000000100… |
… | …110001000111010100101101 |
3 | 211010212010121202201110200221 |
4 | 212121020010301013110231 |
5 | 134112434231102240421 |
6 | 1355041422143251341 |
7 | 50365120324016140 |
oct | 4631100461072455 |
9 | 733763552643627 |
10 | 168852424258861 |
11 | 4988aa0257a882 |
12 | 16b308932a9b51 |
13 | 732a93b635365 |
14 | 2d9a702816057 |
15 | 147c38bbd8841 |
hex | 999204c4752d |
168852424258861 has 8 divisors (see below), whose sum is σ = 196615221778944. Its totient is φ = 141999882395280.
The previous prime is 168852424258823. The next prime is 168852424258907.
168852424258861 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 168852424258861 - 219 = 168852423734573 is a prime.
It is a super-2 number, since 2×1688524242588612 (a number of 29 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 (168852424258261) 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, 227563913725 + ... + 227563914466.
It is an arithmetic number, because the mean of its divisors is an integer number (24576902722368).
Almost surely, 2168852424258861 is an apocalyptic number.
It is an amenable number.
168852424258861 is a deficient number, since it is larger than the sum of its proper divisors (27762797520083).
168852424258861 is an equidigital number, since it uses as much as digits as its factorization.
168852424258861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 455127828251.
The product of its digits is 471859200, while the sum is 70.
The spelling of 168852424258861 in words is "one hundred sixty-eight trillion, eight hundred fifty-two billion, four hundred twenty-four million, two hundred fifty-eight thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •