Base | Representation |
---|---|
bin | 100000100111100000111… |
… | …110110101100101101111 |
3 | 21221021120200101020120112 |
4 | 200213200332311211233 |
5 | 243210443321430111 |
6 | 4433413054410235 |
7 | 320640166101221 |
oct | 40474076654557 |
9 | 7837520336515 |
10 | 2241452530031 |
11 | 79465a578370 |
12 | 3024a9b0097b |
13 | 1334a2847410 |
14 | 7a6b6006411 |
15 | 3d48a707e8b |
hex | 209e0fb596f |
2241452530031 has 16 divisors (see below), whose sum is σ = 2633912860320. Its totient is φ = 1880512043520.
The previous prime is 2241452530003. The next prime is 2241452530043. The reversal of 2241452530031 is 1300352541422.
It is not a de Polignac number, because 2241452530031 - 222 = 2241448335727 is a prime.
It is a super-2 number, since 2×22414525300312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2241452530031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2241452530001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1147070 + ... + 2408043.
It is an arithmetic number, because the mean of its divisors is an integer number (164619553770).
Almost surely, 22241452530031 is an apocalyptic number.
2241452530031 is a deficient number, since it is larger than the sum of its proper divisors (392460330289).
2241452530031 is a wasteful number, since it uses less digits than its factorization.
2241452530031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3559546.
The product of its (nonzero) digits is 28800, while the sum is 32.
The spelling of 2241452530031 in words is "two trillion, two hundred forty-one billion, four hundred fifty-two million, five hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •