Base | Representation |
---|---|
bin | 1000101111010010000… |
… | …0011101111011111111 |
3 | 112100111220001000221212 |
4 | 2023310200131323333 |
5 | 4424432021234444 |
6 | 152545205115035 |
7 | 13563246533033 |
oct | 2136440357377 |
9 | 470456030855 |
10 | 150131039999 |
11 | 58741070476 |
12 | 2511a6b8a7b |
13 | 11207770415 |
14 | 73a2d421c3 |
15 | 3d8a36619e |
hex | 22f481deff |
150131039999 has 4 divisors (see below), whose sum is σ = 158962277664. Its totient is φ = 141299802336.
The previous prime is 150131039987. The next prime is 150131040043. The reversal of 150131039999 is 999930131051.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 150131039999 - 220 = 150129991423 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150131039699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4415618807 + ... + 4415618840.
It is an arithmetic number, because the mean of its divisors is an integer number (39740569416).
Almost surely, 2150131039999 is an apocalyptic number.
150131039999 is a deficient number, since it is larger than the sum of its proper divisors (8831237665).
150131039999 is an equidigital number, since it uses as much as digits as its factorization.
150131039999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8831237664.
The product of its (nonzero) digits is 295245, while the sum is 50.
The spelling of 150131039999 in words is "one hundred fifty billion, one hundred thirty-one million, thirty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •