Base | Representation |
---|---|
bin | 1000101111111111000… |
… | …0011000001110111001 |
3 | 112101000001011000120010 |
4 | 2023333300120032321 |
5 | 4430323324312223 |
6 | 153020030052133 |
7 | 13601030611032 |
oct | 2137760301671 |
9 | 471001130503 |
10 | 150319760313 |
11 | 58828649878 |
12 | 2517194a049 |
13 | 112378a8548 |
14 | 73c0029a89 |
15 | 3d9bbe3393 |
hex | 22ffc183b9 |
150319760313 has 4 divisors (see below), whose sum is σ = 200426347088. Its totient is φ = 100213173540.
The previous prime is 150319760309. The next prime is 150319760323. The reversal of 150319760313 is 313067913051.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 313067913051 = 3 ⋅104355971017.
It is not a de Polignac number, because 150319760313 - 22 = 150319760309 is a prime.
It is a super-3 number, since 3×1503197603133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (150319760303) 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, 25053293383 + ... + 25053293388.
It is an arithmetic number, because the mean of its divisors is an integer number (50106586772).
Almost surely, 2150319760313 is an apocalyptic number.
It is an amenable number.
150319760313 is a deficient number, since it is larger than the sum of its proper divisors (50106586775).
150319760313 is an equidigital number, since it uses as much as digits as its factorization.
150319760313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50106586774.
The product of its (nonzero) digits is 51030, while the sum is 39.
The spelling of 150319760313 in words is "one hundred fifty billion, three hundred nineteen million, seven hundred sixty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •