Base | Representation |
---|---|
bin | 1110101100110100101… |
… | …0101011000001010101 |
3 | 220010212122210222010222 |
4 | 3223031022223001111 |
5 | 13114210324330401 |
6 | 312004151524125 |
7 | 24150300351641 |
oct | 3531512530125 |
9 | 803778728128 |
10 | 252550230101 |
11 | 98119025934 |
12 | 40b42689645 |
13 | 1aa7a5273a0 |
14 | c31b3b9c21 |
15 | 6881b67c1b |
hex | 3acd2ab055 |
252550230101 has 16 divisors (see below), whose sum is σ = 283871997696. Its totient is φ = 222932704896.
The previous prime is 252550230083. The next prime is 252550230137. The reversal of 252550230101 is 101032055252.
252550230101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 252550230101 - 210 = 252550229077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252550230601) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1140056 + ... + 1343438.
It is an arithmetic number, because the mean of its divisors is an integer number (17741999856).
Almost surely, 2252550230101 is an apocalyptic number.
It is an amenable number.
252550230101 is a deficient number, since it is larger than the sum of its proper divisors (31321767595).
252550230101 is a wasteful number, since it uses less digits than its factorization.
252550230101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207572.
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 252550230101 its reverse (101032055252), we get a palindrome (353582285353).
The spelling of 252550230101 in words is "two hundred fifty-two billion, five hundred fifty million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •