Base | Representation |
---|---|
bin | 100100100011101101010… |
… | …100101101100001100010 |
3 | 22220011112111112112201112 |
4 | 210203231110231201202 |
5 | 312130033041433102 |
6 | 5202035220103322 |
7 | 346334466113033 |
oct | 44435524554142 |
9 | 8804474475645 |
10 | 2512242530402 |
11 | 889488461600 |
12 | 346a80b34b42 |
13 | 152b98b72477 |
14 | 898439c4a8a |
15 | 455387dc252 |
hex | 248ed52d862 |
2512242530402 has 48 divisors (see below), whose sum is σ = 4195420802496. Its totient is φ = 1127247079200.
The previous prime is 2512242530393. The next prime is 2512242530423. The reversal of 2512242530402 is 2040352422152.
It is a super-2 number, since 2×25122425304022 (a number of 26 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 24795827 + ... + 24896937.
It is an arithmetic number, because the mean of its divisors is an integer number (87404600052).
Almost surely, 22512242530402 is an apocalyptic number.
2512242530402 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2512242530402 is a deficient number, since it is larger than the sum of its proper divisors (1683178272094).
2512242530402 is a wasteful number, since it uses less digits than its factorization.
2512242530402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102455 (or 102444 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 32.
Adding to 2512242530402 its reverse (2040352422152), we get a palindrome (4552594952554).
It can be divided in two parts, 25122 and 42530402, that added together give a palindrome (42555524).
The spelling of 2512242530402 in words is "two trillion, five hundred twelve billion, two hundred forty-two million, five hundred thirty thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •