Base | Representation |
---|---|
bin | 1001001001110101111… |
… | …1001110001000111110 |
3 | 120000220210101001102202 |
4 | 2102131133032020332 |
5 | 10034032310424300 |
6 | 200124505351502 |
7 | 14235034461533 |
oct | 2223537161076 |
9 | 500823331382 |
10 | 157261029950 |
11 | 6076a82a452 |
12 | 2658a498592 |
13 | 11aa298a39b |
14 | 787bc58d8a |
15 | 41562aaad5 |
hex | 249d7ce23e |
157261029950 has 48 divisors (see below), whose sum is σ = 303032045184. Its totient is φ = 60655305600.
The previous prime is 157261029949. The next prime is 157261029953. The reversal of 157261029950 is 59920162751.
It is a junction number, because it is equal to n+sod(n) for n = 157261029895 and 157261029904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157261029953) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 246212 + ... + 612488.
It is an arithmetic number, because the mean of its divisors is an integer number (6313167608).
Almost surely, 2157261029950 is an apocalyptic number.
157261029950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
157261029950 is a deficient number, since it is larger than the sum of its proper divisors (145771015234).
157261029950 is a wasteful number, since it uses less digits than its factorization.
157261029950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366597 (or 366592 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 47.
The spelling of 157261029950 in words is "one hundred fifty-seven billion, two hundred sixty-one million, twenty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •