Base | Representation |
---|---|
bin | 1001110110100000000… |
… | …0100011011101000111 |
3 | 121011212020021210120221 |
4 | 2131220000203131013 |
5 | 10233110131401411 |
6 | 205430215005211 |
7 | 15141066133552 |
oct | 2355000433507 |
9 | 534766253527 |
10 | 169248700231 |
11 | 6586152a576 |
12 | 28975069807 |
13 | 12c633c5b00 |
14 | 8297d87699 |
15 | 46088e3071 |
hex | 2768023747 |
169248700231 has 6 divisors (see below), whose sum is σ = 183269302800. Its totient is φ = 156229569288.
The previous prime is 169248700211. The next prime is 169248700279. The reversal of 169248700231 is 132007842961.
It is not a de Polignac number, because 169248700231 - 25 = 169248700199 is a prime.
It is a super-2 number, since 2×1692487002312 (a number of 23 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 (169248700211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 500735631 + ... + 500735968.
It is an arithmetic number, because the mean of its divisors is an integer number (30544883800).
Almost surely, 2169248700231 is an apocalyptic number.
169248700231 is a deficient number, since it is larger than the sum of its proper divisors (14020602569).
169248700231 is a wasteful number, since it uses less digits than its factorization.
169248700231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001471625 (or 1001471612 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 43.
The spelling of 169248700231 in words is "one hundred sixty-nine billion, two hundred forty-eight million, seven hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •