Base | Representation |
---|---|
bin | 1000101111101000000… |
… | …1011000101000110011 |
3 | 112100202100010021211221 |
4 | 2023322001120220303 |
5 | 4430124212230443 |
6 | 153002312045511 |
7 | 13565452102315 |
oct | 2137201305063 |
9 | 470670107757 |
10 | 150223555123 |
11 | 5878930a454 |
12 | 25145693897 |
13 | 112209930b5 |
14 | 73b13457b5 |
15 | 3d9353ceed |
hex | 22fa058a33 |
150223555123 has 4 divisors (see below), whose sum is σ = 155069476288. Its totient is φ = 145377633960.
The previous prime is 150223555093. The next prime is 150223555169. The reversal of 150223555123 is 321555322051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 321555322051 = 1399 ⋅229846549.
It is a cyclic number.
It is not a de Polignac number, because 150223555123 - 237 = 12784601651 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150223555523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2422960536 + ... + 2422960597.
It is an arithmetic number, because the mean of its divisors is an integer number (38767369072).
Almost surely, 2150223555123 is an apocalyptic number.
150223555123 is a deficient number, since it is larger than the sum of its proper divisors (4845921165).
150223555123 is an equidigital number, since it uses as much as digits as its factorization.
150223555123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4845921164.
The product of its (nonzero) digits is 45000, while the sum is 34.
Adding to 150223555123 its reverse (321555322051), we get a palindrome (471778877174).
The spelling of 150223555123 in words is "one hundred fifty billion, two hundred twenty-three million, five hundred fifty-five thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •