Base | Representation |
---|---|
bin | 1000110100110101… |
… | …1100100011000000 |
3 | 20010002220101001101 |
4 | 2031031130203000 |
5 | 14322443043011 |
6 | 1031030144144 |
7 | 112465056550 |
oct | 21515344300 |
9 | 6102811041 |
10 | 2369112256 |
11 | 1006336115 |
12 | 5614b2054 |
13 | 2b9a92894 |
14 | 1868dd160 |
15 | dcec42c1 |
hex | 8d35c8c0 |
2369112256 has 112 divisors (see below), whose sum is σ = 5582960640. Its totient is φ = 976066560.
The previous prime is 2369112241. The next prime is 2369112293. The reversal of 2369112256 is 6522119632.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×23691122562 = 11225385763058819072, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2485476 + ... + 2486428.
Almost surely, 22369112256 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2369112256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2791480320).
2369112256 is an abundant number, since it is smaller than the sum of its proper divisors (3213848384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2369112256 is a wasteful number, since it uses less digits than its factorization.
2369112256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182 (or 1172 counting only the distinct ones).
The product of its digits is 38880, while the sum is 37.
The square root of 2369112256 is about 48673.5272607195. The cubic root of 2369112256 is about 1333.0973951412.
The spelling of 2369112256 in words is "two billion, three hundred sixty-nine million, one hundred twelve thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •