Base | Representation |
---|---|
bin | 1000110000101011011… |
… | …0110110001000001001 |
3 | 112101111000121020020112 |
4 | 2030022312312020021 |
5 | 4431214014130001 |
6 | 153050322004105 |
7 | 13605451635332 |
oct | 2141266661011 |
9 | 471430536215 |
10 | 150506005001 |
11 | 58913797200 |
12 | 252041a6635 |
13 | 112673578c1 |
14 | 73daa6b289 |
15 | 3dad231cbb |
hex | 230adb6209 |
150506005001 has 6 divisors (see below), whose sum is σ = 165432220506. Its totient is φ = 136823640800.
The previous prime is 150506004973. The next prime is 150506005007. The reversal of 150506005001 is 100500605051.
It can be written as a sum of positive squares in only one way, i.e., 135055515001 + 15450490000 = 367499^2 + 124300^2 .
It is a de Polignac number, because none of the positive numbers 2k-150506005001 is a prime.
It is a super-2 number, since 2×1505060050012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150506005007) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 621925520 + ... + 621925761.
It is an arithmetic number, because the mean of its divisors is an integer number (27572036751).
Almost surely, 2150506005001 is an apocalyptic number.
150506005001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
150506005001 is a deficient number, since it is larger than the sum of its proper divisors (14926215505).
150506005001 is a wasteful number, since it uses less digits than its factorization.
150506005001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1243851303 (or 1243851292 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 150506005001 in words is "one hundred fifty billion, five hundred six million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •