Base | Representation |
---|---|
bin | 1011001101001000011010… |
… | …0100111000111000100010 |
3 | 1121121210122121001220021021 |
4 | 2303102012210320320202 |
5 | 3103323304322201200 |
6 | 42111455514120054 |
7 | 2411051431206310 |
oct | 263220644707042 |
9 | 47553577056237 |
10 | 12320224022050 |
11 | 3a1aa8330020a |
12 | 146b8aa12002a |
13 | 6b4a3b441439 |
14 | 308432a7d0b0 |
15 | 165725d4c41a |
hex | b3486938e22 |
12320224022050 has 24 divisors (see below), whose sum is σ = 26189276207616. Its totient is φ = 4224076807440.
The previous prime is 12320224022021. The next prime is 12320224022077. The reversal of 12320224022050 is 5022042202321.
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 (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17600319682 + ... + 17600320381.
It is an arithmetic number, because the mean of its divisors is an integer number (1091219841984).
Almost surely, 212320224022050 is an apocalyptic number.
12320224022050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12320224022050 is an abundant number, since it is smaller than the sum of its proper divisors (13869052185566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12320224022050 is a wasteful number, since it uses less digits than its factorization.
12320224022050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35200640082 (or 35200640077 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 25.
Adding to 12320224022050 its reverse (5022042202321), we get a palindrome (17342266224371).
The spelling of 12320224022050 in words is "twelve trillion, three hundred twenty billion, two hundred twenty-four million, twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •