Base | Representation |
---|---|
bin | 1011001000100101011000… |
… | …1001111010000000000000 |
3 | 1121100100000011010201122020 |
4 | 2302021112021322000000 |
5 | 3101033311132343130 |
6 | 42011535533041440 |
7 | 2402314464015543 |
oct | 262112611720000 |
9 | 47310004121566 |
10 | 12242102231040 |
11 | 399a934616370 |
12 | 1458727326280 |
13 | 6aa56b4807b6 |
14 | 30474153885a |
15 | 1636a26d4e10 |
hex | b225627a000 |
12242102231040 has 224 divisors, whose sum is σ = 42733462286016. Its totient is φ = 2967782031360.
The previous prime is 12242102231017. The next prime is 12242102231041. The reversal of 12242102231040 is 4013220124221.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 12242102231040.
It is not an unprimeable number, because it can be changed into a prime (12242102231041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3176797 + ... + 5880156.
Almost surely, 212242102231040 is an apocalyptic number.
12242102231040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12242102231040 is an abundant number, since it is smaller than the sum of its proper divisors (30491360054976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12242102231040 is an equidigital number, since it uses as much as digits as its factorization.
12242102231040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9056998 (or 9056974 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 12242102231040 its reverse (4013220124221), we get a palindrome (16255322355261).
The spelling of 12242102231040 in words is "twelve trillion, two hundred forty-two billion, one hundred two million, two hundred thirty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •