Base | Representation |
---|---|
bin | 1000101111011011111… |
… | …1101100001000111000 |
3 | 112100121210120121012011 |
4 | 2023312333230020320 |
5 | 4430023212412224 |
6 | 152553255455304 |
7 | 13564264363210 |
oct | 2136677541070 |
9 | 470553517164 |
10 | 150172779064 |
11 | 58762689670 |
12 | 25130687534 |
13 | 112132c56a9 |
14 | 73a86c9240 |
15 | 3d8dd5d394 |
hex | 22f6fec238 |
150172779064 has 128 divisors (see below), whose sum is σ = 361148958720. Its totient is φ = 56844518400.
The previous prime is 150172779037. The next prime is 150172779077. The reversal of 150172779064 is 460977271051.
It is a junction number, because it is equal to n+sod(n) for n = 150172778999 and 150172779017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3947494 + ... + 3985354.
It is an arithmetic number, because the mean of its divisors is an integer number (2821476240).
Almost surely, 2150172779064 is an apocalyptic number.
150172779064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 150172779064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180574479360).
150172779064 is an abundant number, since it is smaller than the sum of its proper divisors (210976179656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150172779064 is a wasteful number, since it uses less digits than its factorization.
150172779064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38069 (or 38065 counting only the distinct ones).
The product of its (nonzero) digits is 740880, while the sum is 49.
The spelling of 150172779064 in words is "one hundred fifty billion, one hundred seventy-two million, seven hundred seventy-nine thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •