Base | Representation |
---|---|
bin | 100001100100001110111… |
… | …111111011100100010000 |
3 | 22011111212100012001001112 |
4 | 201210032333323210100 |
5 | 300243004130444112 |
6 | 4523354314552452 |
7 | 325435625442515 |
oct | 41441677734420 |
9 | 8144770161045 |
10 | 2306649078032 |
11 | 80a2762a78a2 |
12 | 313064138728 |
13 | 139692a7c180 |
14 | 7d8dcac130c |
15 | 40004288a22 |
hex | 2190effb910 |
2306649078032 has 80 divisors (see below), whose sum is σ = 4894918340592. Its totient is φ = 1046489794560.
The previous prime is 2306649077923. The next prime is 2306649078047. The reversal of 2306649078032 is 2308709466032.
2306649078032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 1243349883136 + 1063299194896 = 1115056^2 + 1031164^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20205818 + ... + 20319654.
Almost surely, 22306649078032 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 2306649078032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2447459170296).
2306649078032 is an abundant number, since it is smaller than the sum of its proper divisors (2588269262560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2306649078032 is a wasteful number, since it uses less digits than its factorization.
2306649078032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115516 (or 115510 counting only the distinct ones).
The product of its (nonzero) digits is 2612736, while the sum is 50.
The spelling of 2306649078032 in words is "two trillion, three hundred six billion, six hundred forty-nine million, seventy-eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •