Base | Representation |
---|---|
bin | 1000101111001101110… |
… | …0011101011011011011 |
3 | 112100110122111021201011 |
4 | 2023303130131123123 |
5 | 4424412440241443 |
6 | 152543331034351 |
7 | 13562642151520 |
oct | 2136334353333 |
9 | 470418437634 |
10 | 150113212123 |
11 | 58731aa4096 |
12 | 2511473b9b7 |
13 | 11203b6a894 |
14 | 73a0821147 |
15 | 3d889e3b9d |
hex | 22f371d6db |
150113212123 has 8 divisors (see below), whose sum is σ = 171564077792. Its totient is φ = 128663876736.
The previous prime is 150113212097. The next prime is 150113212141. The reversal of 150113212123 is 321212311051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150113212123 - 25 = 150113212091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150113212094 and 150113212103.
It is not an unprimeable number, because it can be changed into a prime (150113212153) 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 7 ways as a sum of consecutive naturals, for example, 164040 + ... + 571957.
It is an arithmetic number, because the mean of its divisors is an integer number (21445509724).
Almost surely, 2150113212123 is an apocalyptic number.
150113212123 is a deficient number, since it is larger than the sum of its proper divisors (21450865669).
150113212123 is an equidigital number, since it uses as much as digits as its factorization.
150113212123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765141.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 150113212123 its reverse (321212311051), we get a palindrome (471325523174).
The spelling of 150113212123 in words is "one hundred fifty billion, one hundred thirteen million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.643 sec. • engine limits •