Base | Representation |
---|---|
bin | 1001000101010101010… |
… | …1100110111100101010 |
3 | 112220210102122022220010 |
4 | 2101111111212330222 |
5 | 10024042420104240 |
6 | 155404424512350 |
7 | 14163035536245 |
oct | 2212525467452 |
9 | 486712568803 |
10 | 156050550570 |
11 | 601a9516372 |
12 | 262b101b6b6 |
13 | 1193bc670b5 |
14 | 77a519c25c |
15 | 40d4da0280 |
hex | 2455566f2a |
156050550570 has 32 divisors (see below), whose sum is σ = 374532079680. Its totient is φ = 41612284800.
The previous prime is 156050550547. The next prime is 156050550707. The reversal of 156050550570 is 75055050651.
156050550570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
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, 1609470 + ... + 1703670.
It is an arithmetic number, because the mean of its divisors is an integer number (11704127490).
Almost surely, 2156050550570 is an apocalyptic number.
156050550570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
156050550570 is an abundant number, since it is smaller than the sum of its proper divisors (218481529110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156050550570 is a wasteful number, since it uses less digits than its factorization.
156050550570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149430.
The product of its (nonzero) digits is 131250, while the sum is 39.
The spelling of 156050550570 in words is "one hundred fifty-six billion, fifty million, five hundred fifty thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •