Base | Representation |
---|---|
bin | 1000110001000000010… |
… | …1001101000010110100 |
3 | 112101201010112022101110 |
4 | 2030100011031002310 |
5 | 4431403433424324 |
6 | 153103132355020 |
7 | 13610564642514 |
oct | 2142005150264 |
9 | 471633468343 |
10 | 150593654964 |
11 | 58959212995 |
12 | 25229615a70 |
13 | 1127c565c9c |
14 | 7408565844 |
15 | 3db5c97329 |
hex | 231014d0b4 |
150593654964 has 48 divisors (see below), whose sum is σ = 377608004928. Its totient is φ = 46539913728.
The previous prime is 150593654957. The next prime is 150593654969. The reversal of 150593654964 is 469456395051.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150593654969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5495319 + ... + 5522654.
It is an arithmetic number, because the mean of its divisors is an integer number (7866833436).
Almost surely, 2150593654964 is an apocalyptic number.
It is an amenable number.
150593654964 is an abundant number, since it is smaller than the sum of its proper divisors (227014349964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150593654964 is a wasteful number, since it uses less digits than its factorization.
150593654964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11018064 (or 11018062 counting only the distinct ones).
The product of its (nonzero) digits is 17496000, while the sum is 57.
The spelling of 150593654964 in words is "one hundred fifty billion, five hundred ninety-three million, six hundred fifty-four thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •