Base | Representation |
---|---|
bin | 1011001011110111000011… |
… | …0111111101010000010000 |
3 | 1121112201021121020222020210 |
4 | 2302331300313331100100 |
5 | 3102444043040213311 |
6 | 42053444454004120 |
7 | 2406346306256241 |
oct | 262756067752020 |
9 | 47481247228223 |
10 | 12298385085456 |
11 | 3a11796842988 |
12 | 1467614346640 |
13 | 6b296aa92c52 |
14 | 307360466cc8 |
15 | 164d989363a6 |
hex | b2f70dfd410 |
12298385085456 has 20 divisors (see below), whose sum is σ = 31770828137552. Its totient is φ = 4099461695136.
The previous prime is 12298385085443. The next prime is 12298385085457. The reversal of 12298385085456 is 65458058389221.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (12298385085457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128108177926 + ... + 128108178021.
Almost surely, 212298385085456 is an apocalyptic number.
12298385085456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12298385085456 is an abundant number, since it is smaller than the sum of its proper divisors (19472443052096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12298385085456 is a wasteful number, since it uses less digits than its factorization.
12298385085456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256216355958 (or 256216355952 counting only the distinct ones).
The product of its (nonzero) digits is 165888000, while the sum is 66.
The spelling of 12298385085456 in words is "twelve trillion, two hundred ninety-eight billion, three hundred eighty-five million, eighty-five thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •