Base | Representation |
---|---|
bin | 10001111001001… |
… | …10101110110100 |
3 | 101110110010100220 |
4 | 20330212232310 |
5 | 301411330022 |
6 | 22521134340 |
7 | 3501604641 |
oct | 1074465664 |
9 | 343403326 |
10 | 150105012 |
11 | 77804132 |
12 | 4232a3b0 |
13 | 25137945 |
14 | 15d14dc8 |
15 | d2a085c |
hex | 8f26bb4 |
150105012 has 12 divisors (see below), whose sum is σ = 350245056. Its totient is φ = 50035000.
The previous prime is 150105001. The next prime is 150105013. The reversal of 150105012 is 210501051.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 150104982 and 150105000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150105013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6254364 + ... + 6254387.
It is an arithmetic number, because the mean of its divisors is an integer number (29187088).
Almost surely, 2150105012 is an apocalyptic number.
150105012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
150105012 is an abundant number, since it is smaller than the sum of its proper divisors (200140044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150105012 is a wasteful number, since it uses less digits than its factorization.
150105012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12508758 (or 12508756 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 150105012 is about 12251.7350607985. The cubic root of 150105012 is about 531.4532466699.
Adding to 150105012 its reverse (210501051), we get a palindrome (360606063).
The spelling of 150105012 in words is "one hundred fifty million, one hundred five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •