Base | Representation |
---|---|
bin | 100010001011110011110000… |
… | …101110110100010111011001 |
3 | 201201022211220201010222222102 |
4 | 202023303300232310113121 |
5 | 124201223202423043022 |
6 | 1251431323514133145 |
7 | 43445034042512213 |
oct | 4213636056642731 |
9 | 651284821128872 |
10 | 150345074034137 |
11 | 439a4a95893544 |
12 | 14a41a711211b5 |
13 | 65b7630a2a728 |
14 | 291aa5197d5b3 |
15 | 125ac48ca2a92 |
hex | 88bcf0bb45d9 |
150345074034137 has 32 divisors (see below), whose sum is σ = 163750831200000. Its totient is φ = 137458514239488.
The previous prime is 150345074034109. The next prime is 150345074034193. The reversal of 150345074034137 is 731430470543051.
It is not a de Polignac number, because 150345074034137 - 26 = 150345074034073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150345074034091 and 150345074034100.
It is not an unprimeable number, because it can be changed into a prime (150345074034937) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1007877164 + ... + 1008026322.
It is an arithmetic number, because the mean of its divisors is an integer number (5117213475000).
Almost surely, 2150345074034137 is an apocalyptic number.
150345074034137 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
150345074034137 is a deficient number, since it is larger than the sum of its proper divisors (13405757165863).
150345074034137 is a wasteful number, since it uses less digits than its factorization.
150345074034137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151745.
The product of its (nonzero) digits is 2116800, while the sum is 47.
The spelling of 150345074034137 in words is "one hundred fifty trillion, three hundred forty-five billion, seventy-four million, thirty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •