Base | Representation |
---|---|
bin | 1000110000000110001… |
… | …1110110100110000001 |
3 | 112101002011002221110022 |
4 | 2030001203312212001 |
5 | 4430404101444413 |
6 | 153023030543225 |
7 | 13601546115323 |
oct | 2140143664601 |
9 | 471064087408 |
10 | 150350031233 |
11 | 58843744866 |
12 | 2517bb07b15 |
13 | 11240c4692c |
14 | 73c4069613 |
15 | 3d9e6c2608 |
hex | 23018f6981 |
150350031233 has 4 divisors (see below), whose sum is σ = 150573434628. Its totient is φ = 150126627840.
The previous prime is 150350031131. The next prime is 150350031269. The reversal of 150350031233 is 332130053051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 332130053051 = 509 ⋅652514839.
It can be written as a sum of positive squares in 2 ways, for example, as 63429429904 + 86920601329 = 251852^2 + 294823^2 .
It is a cyclic number.
It is not a de Polignac number, because 150350031233 - 210 = 150350030209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150350031833) 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, 111700688 + ... + 111702033.
It is an arithmetic number, because the mean of its divisors is an integer number (37643358657).
Almost surely, 2150350031233 is an apocalyptic number.
It is an amenable number.
150350031233 is a deficient number, since it is larger than the sum of its proper divisors (223403395).
150350031233 is an equidigital number, since it uses as much as digits as its factorization.
150350031233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223403394.
The product of its (nonzero) digits is 4050, while the sum is 26.
Adding to 150350031233 its reverse (332130053051), we get a palindrome (482480084284).
The spelling of 150350031233 in words is "one hundred fifty billion, three hundred fifty million, thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •