Base | Representation |
---|---|
bin | 111111110010101010… |
… | …111000100100101000 |
3 | 20112210121000001210122 |
4 | 333302222320210220 |
5 | 2110234413244410 |
6 | 51244435302412 |
7 | 4643251004120 |
oct | 776252704450 |
9 | 215717001718 |
10 | 68495837480 |
11 | 2705a129554 |
12 | 1133714aa08 |
13 | 65c7928865 |
14 | 345ad4bc80 |
15 | 1bad542e55 |
hex | ff2ab8928 |
68495837480 has 32 divisors (see below), whose sum is σ = 176132154240. Its totient is φ = 23484287040.
The previous prime is 68495837477. The next prime is 68495837483. The reversal of 68495837480 is 8473859486.
It is an interprime number because it is at equal distance from previous prime (68495837477) and next prime (68495837483).
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (68495837483) 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 7 ways as a sum of consecutive naturals, for example, 122313716 + ... + 122314275.
It is an arithmetic number, because the mean of its divisors is an integer number (5504129820).
Almost surely, 268495837480 is an apocalyptic number.
It is an amenable number.
68495837480 is an abundant number, since it is smaller than the sum of its proper divisors (107636316760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68495837480 is a wasteful number, since it uses less digits than its factorization.
68495837480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244628009 (or 244628005 counting only the distinct ones).
The product of its (nonzero) digits is 46448640, while the sum is 62.
The spelling of 68495837480 in words is "sixty-eight billion, four hundred ninety-five million, eight hundred thirty-seven thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •