Base | Representation |
---|---|
bin | 1011001010111001001101… |
… | …1110010000000010000000 |
3 | 1121111010102202112210202010 |
4 | 2302232103132100002000 |
5 | 3102211044113230000 |
6 | 42042101403052520 |
7 | 2405221045534164 |
oct | 262562336200200 |
9 | 47433382483663 |
10 | 12281785680000 |
11 | 3a05748915981 |
12 | 1464361211140 |
13 | 6b1223a8b945 |
14 | 306627a64ca4 |
15 | 1647264ddd50 |
hex | b2b93790080 |
12281785680000 has 160 divisors (see below), whose sum is σ = 40766317914960. Its totient is φ = 3275142784000.
The previous prime is 12281785679983. The next prime is 12281785680007. The reversal of 12281785680000 is 8658718221.
It is a tau number, because it is divible by the number of its divisors (160).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (12281785680007) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 25347054 + ... + 25827053.
Almost surely, 212281785680000 is an apocalyptic number.
12281785680000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12281785680000 is an abundant number, since it is smaller than the sum of its proper divisors (28484532234960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12281785680000 is an frugal number, since it uses more digits than its factorization.
12281785680000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51174144 (or 51174117 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 48.
The spelling of 12281785680000 in words is "twelve trillion, two hundred eighty-one billion, seven hundred eighty-five million, six hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •