Base | Representation |
---|---|
bin | 10111110100100010… |
… | …10001000101110000 |
3 | 1020000021022120120110 |
4 | 23322101101011300 |
5 | 202142410440130 |
6 | 5513003341320 |
7 | 631626465162 |
oct | 137221210560 |
9 | 36007276513 |
10 | 12788765040 |
11 | 5472a19507 |
12 | 258ab21840 |
13 | 128a6b29bc |
14 | 8946a0932 |
15 | 4ecb28ab0 |
hex | 2fa451170 |
12788765040 has 40 divisors (see below), whose sum is σ = 39645172368. Its totient is φ = 3410337280.
The previous prime is 12788765039. The next prime is 12788765047. The reversal of 12788765040 is 4056788721.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×127887650402 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) 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 (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12788765047) 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, 26643021 + ... + 26643500.
Almost surely, 212788765040 is an apocalyptic number.
12788765040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12788765040 is an abundant number, since it is smaller than the sum of its proper divisors (26856407328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12788765040 is a wasteful number, since it uses less digits than its factorization.
12788765040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53286537 (or 53286531 counting only the distinct ones).
The product of its (nonzero) digits is 752640, while the sum is 48.
The spelling of 12788765040 in words is "twelve billion, seven hundred eighty-eight million, seven hundred sixty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •