Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …000010011011100001000 |
3 | 21011111211000110011202101 |
4 | 131131023300103130020 |
5 | 231131030320101102 |
6 | 4145523242443144 |
7 | 266146401533614 |
oct | 35351360233410 |
9 | 7144730404671 |
10 | 2024200550152 |
11 | 710505492360 |
12 | 2883788034b4 |
13 | 118b5c27b231 |
14 | 6dd869b2344 |
15 | 379c28d5e87 |
hex | 1d74bc13708 |
2024200550152 has 32 divisors (see below), whose sum is σ = 4140636367680. Its totient is φ = 920040903360.
The previous prime is 2024200550137. The next prime is 2024200550153. The reversal of 2024200550152 is 2510550024202.
It is a self number, because there is not a number n which added to its sum of digits gives 2024200550152.
It is not an unprimeable number, because it can be changed into a prime (2024200550153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1016398 + ... + 2254210.
It is an arithmetic number, because the mean of its divisors is an integer number (129394886490).
Almost surely, 22024200550152 is an apocalyptic number.
2024200550152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2024200550152 is an abundant number, since it is smaller than the sum of its proper divisors (2116435817528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2024200550152 is a wasteful number, since it uses less digits than its factorization.
2024200550152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1256413 (or 1256409 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
Adding to 2024200550152 its reverse (2510550024202), we get a palindrome (4534750574354).
The spelling of 2024200550152 in words is "two trillion, twenty-four billion, two hundred million, five hundred fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •