Base | Representation |
---|---|
bin | 10110111001110000… |
… | …01010100110010110 |
3 | 1011201220102111212010 |
4 | 23130320022212112 |
5 | 200140141124330 |
6 | 5352030205050 |
7 | 613461156144 |
oct | 133470124626 |
9 | 34656374763 |
10 | 12295645590 |
11 | 523a631578 |
12 | 2471953786 |
13 | 120c499647 |
14 | 848dba594 |
15 | 4be6be3b0 |
hex | 2dce0a996 |
12295645590 has 64 divisors (see below), whose sum is σ = 31484090880. Its totient is φ = 3062392320.
The previous prime is 12295645567. The next prime is 12295645627. The reversal of 12295645590 is 9554659221.
12295645590 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 25210 + ... + 158829.
It is an arithmetic number, because the mean of its divisors is an integer number (491938920).
Almost surely, 212295645590 is an apocalyptic number.
12295645590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12295645590 is an abundant number, since it is smaller than the sum of its proper divisors (19188445290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12295645590 is a wasteful number, since it uses less digits than its factorization.
12295645590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184197.
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 12295645590 in words is "twelve billion, two hundred ninety-five million, six hundred forty-five thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •