Base | Representation |
---|---|
bin | 10110111110001000… |
… | …11001000100111010 |
3 | 1011211110121002100121 |
4 | 23133010121010322 |
5 | 200224043430200 |
6 | 5355422123454 |
7 | 614415466450 |
oct | 133704310472 |
9 | 34743532317 |
10 | 12332405050 |
11 | 5259359499 |
12 | 248212058a |
13 | 1216c9a1c4 |
14 | 84dc289d0 |
15 | 4c2a30e1a |
hex | 2df11913a |
12332405050 has 48 divisors (see below), whose sum is σ = 27594930240. Its totient is φ = 4005711360.
The previous prime is 12332405023. The next prime is 12332405083. The reversal of 12332405050 is 5050423321.
12332405050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 23 ways as a sum of consecutive naturals, for example, 920599 + ... + 933898.
It is an arithmetic number, because the mean of its divisors is an integer number (574894380).
Almost surely, 212332405050 is an apocalyptic number.
12332405050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12332405050 is an abundant number, since it is smaller than the sum of its proper divisors (15262525190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12332405050 is a wasteful number, since it uses less digits than its factorization.
12332405050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1854535 (or 1854530 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 12332405050 its reverse (5050423321), we get a palindrome (17382828371).
The spelling of 12332405050 in words is "twelve billion, three hundred thirty-two million, four hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •