Base | Representation |
---|---|
bin | 1000101110110110001… |
… | …1101010000111010001 |
3 | 112100012202121221001120 |
4 | 2023231203222013101 |
5 | 4424212143421133 |
6 | 152525441552453 |
7 | 13560332444055 |
oct | 2135543520721 |
9 | 470182557046 |
10 | 150014435793 |
11 | 58691268a62 |
12 | 250a7645729 |
13 | 111b9565051 |
14 | 739166bc65 |
15 | 3d7eed1ab3 |
hex | 22ed8ea1d1 |
150014435793 has 4 divisors (see below), whose sum is σ = 200019247728. Its totient is φ = 100009623860.
The previous prime is 150014435789. The next prime is 150014435861. The reversal of 150014435793 is 397534410051.
150014435793 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 150014435793 - 22 = 150014435789 is a prime.
It is not an unprimeable number, because it can be changed into a prime (150014435093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25002405963 + ... + 25002405968.
It is an arithmetic number, because the mean of its divisors is an integer number (50004811932).
Almost surely, 2150014435793 is an apocalyptic number.
It is an amenable number.
150014435793 is a deficient number, since it is larger than the sum of its proper divisors (50004811935).
150014435793 is an equidigital number, since it uses as much as digits as its factorization.
150014435793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50004811934.
The product of its (nonzero) digits is 226800, while the sum is 42.
The spelling of 150014435793 in words is "one hundred fifty billion, fourteen million, four hundred thirty-five thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •