Base | Representation |
---|---|
bin | 1110101010110110101… |
… | …1110101100010100111 |
3 | 220002111211221210102021 |
4 | 3222231223311202213 |
5 | 13112120121144111 |
6 | 311435523124011 |
7 | 24131225051050 |
oct | 3525553654247 |
9 | 802454853367 |
10 | 252022053031 |
11 | 97977973661 |
12 | 40a15813607 |
13 | 1a9c4c87c88 |
14 | c2ab1ab727 |
15 | 68505d5d71 |
hex | 3aadaf58a7 |
252022053031 has 16 divisors (see below), whose sum is σ = 288876685824. Its totient is φ = 215381241504.
The previous prime is 252022053013. The next prime is 252022053053. The reversal of 252022053031 is 130350220252.
It is not a de Polignac number, because 252022053031 - 29 = 252022052519 is a prime.
It is a super-2 number, since 2×2520220530312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 252022052987 and 252022053005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252022053061) 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, 3197806 + ... + 3275668.
It is an arithmetic number, because the mean of its divisors is an integer number (18054792864).
Almost surely, 2252022053031 is an apocalyptic number.
252022053031 is a deficient number, since it is larger than the sum of its proper divisors (36854632793).
252022053031 is an equidigital number, since it uses as much as digits as its factorization.
252022053031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79230.
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 252022053031 its reverse (130350220252), we get a palindrome (382372273283).
The spelling of 252022053031 in words is "two hundred fifty-two billion, twenty-two million, fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •