Base | Representation |
---|---|
bin | 10111100111001011… |
… | …10101101001000000 |
3 | 1012201110110221201111 |
4 | 23303211311221000 |
5 | 201430214421440 |
6 | 5453522013104 |
7 | 626066213644 |
oct | 136345655100 |
9 | 35643427644 |
10 | 12676717120 |
11 | 5415749221 |
12 | 25594a7194 |
13 | 1270411462 |
14 | 883854c24 |
15 | 4e2d944ea |
hex | 2f3975a40 |
12676717120 has 28 divisors (see below), whose sum is σ = 30186433404. Its totient is φ = 5070686720.
The previous prime is 12676717117. The next prime is 12676717159. The reversal of 12676717120 is 2171767621.
It is a happy number.
12676717120 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 1302921216 + 11373795904 = 36096^2 + 106648^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19807051 + ... + 19807690.
Almost surely, 212676717120 is an apocalyptic number.
12676717120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12676717120 is an abundant number, since it is smaller than the sum of its proper divisors (17509716284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12676717120 is an equidigital number, since it uses as much as digits as its factorization.
12676717120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39614758 (or 39614748 counting only the distinct ones).
The product of its (nonzero) digits is 49392, while the sum is 40.
The spelling of 12676717120 in words is "twelve billion, six hundred seventy-six million, seven hundred seventeen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •