Base | Representation |
---|---|
bin | 1010111111100101010110… |
… | …1100110011010010101010 |
3 | 1120210112212222012002022010 |
4 | 2233321111230303102222 |
5 | 3041020122244404410 |
6 | 41412524255340350 |
7 | 2355201626610252 |
oct | 257712554632252 |
9 | 46715788162263 |
10 | 12087475778730 |
11 | 39402a6a59110 |
12 | 14327732216b6 |
13 | 698ac8581ac1 |
14 | 2db073562962 |
15 | 15e652889c20 |
hex | afe55b334aa |
12087475778730 has 64 divisors (see below), whose sum is σ = 31663042560000. Its totient is φ = 2928831117120.
The previous prime is 12087475778689. The next prime is 12087475778731. The reversal of 12087475778730 is 3787757478021.
It is a super-2 number, since 2×120874757787302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12087475778731) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8502090 + ... + 9821429.
It is an arithmetic number, because the mean of its divisors is an integer number (494735040000).
Almost surely, 212087475778730 is an apocalyptic number.
12087475778730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12087475778730 is an abundant number, since it is smaller than the sum of its proper divisors (19575566781270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12087475778730 is a wasteful number, since it uses less digits than its factorization.
12087475778730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18325539.
The product of its (nonzero) digits is 129077760, while the sum is 66.
The spelling of 12087475778730 in words is "twelve trillion, eighty-seven billion, four hundred seventy-five million, seven hundred seventy-eight thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •