Base | Representation |
---|---|
bin | 10011010001010101000… |
… | …10111011101111110000 |
3 | 2100022002120220100021000 |
4 | 21220222202323233300 |
5 | 41322030010424042 |
6 | 1224103215402000 |
7 | 65560262430036 |
oct | 11505242735760 |
9 | 2308076810230 |
10 | 662138764272 |
11 | 2358a2085937 |
12 | a83b0b23300 |
13 | 4a59352878b |
14 | 24094bd4556 |
15 | 1235524374c |
hex | 9a2a8bbbf0 |
662138764272 has 40 divisors (see below), whose sum is σ = 1900583491280. Its totient is φ = 220712921280.
The previous prime is 662138764271. The next prime is 662138764351. The reversal of 662138764272 is 272467831266.
662138764272 is a `hidden beast` number, since 6 + 621 + 3 + 8 + 7 + 6 + 4 + 2 + 7 + 2 = 666.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (662138764271) 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, 766363879 + ... + 766364742.
It is an arithmetic number, because the mean of its divisors is an integer number (47514587282).
Almost surely, 2662138764272 is an apocalyptic number.
It is an amenable number.
662138764272 is an abundant number, since it is smaller than the sum of its proper divisors (1238444727008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
662138764272 is a wasteful number, since it uses less digits than its factorization.
662138764272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1532728638 (or 1532728626 counting only the distinct ones).
The product of its digits is 8128512, while the sum is 54.
The spelling of 662138764272 in words is "six hundred sixty-two billion, one hundred thirty-eight million, seven hundred sixty-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •