Base | Representation |
---|---|
bin | 100000110101101010110… |
… | …101001010101001000000 |
3 | 21222201210211101110100020 |
4 | 200311222311022221000 |
5 | 243433104414340022 |
6 | 4444405112253440 |
7 | 322015615543410 |
oct | 40655265125100 |
9 | 7881724343306 |
10 | 2256650152512 |
11 | 7a00491a9048 |
12 | 30542b6a1280 |
13 | 134a552c7542 |
14 | 7b318590640 |
15 | 3da79a5735c |
hex | 20d6ad4aa40 |
2256650152512 has 112 divisors (see below), whose sum is σ = 6824272490112. Its totient is φ = 644701224960.
The previous prime is 2256650152511. The next prime is 2256650152567. The reversal of 2256650152512 is 2152510566522.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (2256650152511) 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 15 ways as a sum of consecutive naturals, for example, 16885312 + ... + 17018432.
It is an arithmetic number, because the mean of its divisors is an integer number (60931004376).
Almost surely, 22256650152512 is an apocalyptic number.
It is an amenable number.
2256650152512 is an abundant number, since it is smaller than the sum of its proper divisors (4567622337600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2256650152512 is a wasteful number, since it uses less digits than its factorization.
2256650152512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145756 (or 145746 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 42.
The spelling of 2256650152512 in words is "two trillion, two hundred fifty-six billion, six hundred fifty million, one hundred fifty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •