Base | Representation |
---|---|
bin | 100110100001100000010101… |
… | …110101000010011101000001 |
3 | 211012220011220002022122111202 |
4 | 212201200111311002131001 |
5 | 134201403011421232300 |
6 | 1400202131313550545 |
7 | 50454533431040426 |
oct | 4641402565023501 |
9 | 735804802278452 |
10 | 169428236117825 |
11 | 49a92125337a73 |
12 | 170043b1575455 |
13 | 7370025001c79 |
14 | 2dba528487d4d |
15 | 148c33d29ead5 |
hex | 9a1815d42741 |
169428236117825 has 6 divisors (see below), whose sum is σ = 210091012786134. Its totient is φ = 135542588894240.
The previous prime is 169428236117773. The next prime is 169428236117843. The reversal of 169428236117825 is 528711632824961.
It can be written as a sum of positive squares in 3 ways, for example, as 985320272689 + 168442915845136 = 992633^2 + 12978556^2 .
It is not a de Polignac number, because 169428236117825 - 26 = 169428236117761 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3388564722332 + ... + 3388564722381.
It is an arithmetic number, because the mean of its divisors is an integer number (35015168797689).
Almost surely, 2169428236117825 is an apocalyptic number.
It is an amenable number.
169428236117825 is a deficient number, since it is larger than the sum of its proper divisors (40662776668309).
169428236117825 is an equidigital number, since it uses as much as digits as its factorization.
169428236117825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6777129444723 (or 6777129444718 counting only the distinct ones).
The product of its digits is 69672960, while the sum is 65.
The spelling of 169428236117825 in words is "one hundred sixty-nine trillion, four hundred twenty-eight billion, two hundred thirty-six million, one hundred seventeen thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •