Base | Representation |
---|---|
bin | 101111110000010001100001… |
… | …110001110101111001000111 |
3 | 1000112122020122002012020101212 |
4 | 233300101201301311321013 |
5 | 210012024302023331101 |
6 | 2022404222431442035 |
7 | 62144562462601013 |
oct | 5760214161657107 |
9 | 1015566562166355 |
10 | 210025541230151 |
11 | 60a14371740639 |
12 | 1b68043498631b |
13 | 9026428b1042a |
14 | 39c140cd45543 |
15 | 19433a64641bb |
hex | bf0461c75e47 |
210025541230151 has 12 divisors (see below), whose sum is σ = 217519775558904. Its totient is φ = 202781191821600.
The previous prime is 210025541230121. The next prime is 210025541230177. The reversal of 210025541230151 is 151032145520012.
It is not a de Polignac number, because 210025541230151 - 214 = 210025541213767 is a prime.
It is a super-2 number, since 2×2100255412301512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210025541230111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83722616 + ... + 86194706.
It is an arithmetic number, because the mean of its divisors is an integer number (18126647963242).
Almost surely, 2210025541230151 is an apocalyptic number.
210025541230151 is a deficient number, since it is larger than the sum of its proper divisors (7494234328753).
210025541230151 is a wasteful number, since it uses less digits than its factorization.
210025541230151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2573170 (or 2573141 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 210025541230151 its reverse (151032145520012), we get a palindrome (361057686750163).
The spelling of 210025541230151 in words is "two hundred ten trillion, twenty-five billion, five hundred forty-one million, two hundred thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •