Base | Representation |
---|---|
bin | 1001001001100010110… |
… | …1111110100100011010 |
3 | 120000201012210201210020 |
4 | 2102120231332210122 |
5 | 10033401314343000 |
6 | 200112530331310 |
7 | 14233043363013 |
oct | 2223055764432 |
9 | 500635721706 |
10 | 157181012250 |
11 | 60729646a19 |
12 | 26567729b36 |
13 | 11a8c221c32 |
14 | 787138a00a |
15 | 414e251ba0 |
hex | 2498b7e91a |
157181012250 has 32 divisors (see below), whose sum is σ = 392323808448. Its totient is φ = 41914936400.
The previous prime is 157181012243. The next prime is 157181012269. The reversal of 157181012250 is 52210181751.
157181012250 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1571810122502 (a number of 23 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 15 ways as a sum of consecutive naturals, for example, 104786592 + ... + 104788091.
It is an arithmetic number, because the mean of its divisors is an integer number (12260119014).
Almost surely, 2157181012250 is an apocalyptic number.
157181012250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
157181012250 is an abundant number, since it is smaller than the sum of its proper divisors (235142796198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157181012250 is a wasteful number, since it uses less digits than its factorization.
157181012250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209574703 (or 209574693 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 33.
The spelling of 157181012250 in words is "one hundred fifty-seven billion, one hundred eighty-one million, twelve thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •