Base | Representation |
---|---|
bin | 1001110100101000111… |
… | …0110101011100100010 |
3 | 121010120102020212120122 |
4 | 2131022032311130202 |
5 | 10231044234034313 |
6 | 205304451240242 |
7 | 15122521626302 |
oct | 2351216653442 |
9 | 533512225518 |
10 | 168749127458 |
11 | 6562553510a |
12 | 288558a9082 |
13 | 12bb3a60312 |
14 | 824b8a3602 |
15 | 45c9b11708 |
hex | 274a3b5722 |
168749127458 has 6 divisors (see below), whose sum is σ = 253124562609. Its totient is φ = 84374273256.
The previous prime is 168749127451. The next prime is 168749127511. The reversal of 168749127458 is 854721947861.
168749127458 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 147837943009 + 20911184449 = 384497^2 + 144607^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=290473.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 168749127458.
It is not an unprimeable number, because it can be changed into a prime (168749127451) by changing a digit.
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 2 ways as a sum of consecutive naturals, for example, 435710 + ... + 726182.
Almost surely, 2168749127458 is an apocalyptic number.
168749127458 is a deficient number, since it is larger than the sum of its proper divisors (84375435151).
168749127458 is an frugal number, since it uses more digits than its factorization.
168749127458 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580948 (or 290475 counting only the distinct ones).
The product of its digits is 27095040, while the sum is 62.
The spelling of 168749127458 in words is "one hundred sixty-eight billion, seven hundred forty-nine million, one hundred twenty-seven thousand, four hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •