Base | Representation |
---|---|
bin | 100010001111000111010110… |
… | …000100110010011010010001 |
3 | 201202010120022200202122210211 |
4 | 202033013112010302122101 |
5 | 124213433442034401103 |
6 | 1252123535155324121 |
7 | 43500325654141060 |
oct | 4217072604623221 |
9 | 652116280678724 |
10 | 150572260075153 |
11 | 43a82378446734 |
12 | 14a79ab52b0641 |
13 | 6602b98437bb7 |
14 | 2927a444901d7 |
15 | 1261ae3caa36d |
hex | 88f1d6132691 |
150572260075153 has 4 divisors (see below), whose sum is σ = 172082582943040. Its totient is φ = 129061937207268.
The previous prime is 150572260075099. The next prime is 150572260075163. The reversal of 150572260075153 is 351570062275051.
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 150572260075153 - 29 = 150572260074641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150572260075097 and 150572260075106.
It is not an unprimeable number, because it can be changed into a prime (150572260075163) 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, 10755161433933 + ... + 10755161433946.
It is an arithmetic number, because the mean of its divisors is an integer number (43020645735760).
Almost surely, 2150572260075153 is an apocalyptic number.
It is an amenable number.
150572260075153 is a deficient number, since it is larger than the sum of its proper divisors (21510322867887).
150572260075153 is an equidigital number, since it uses as much as digits as its factorization.
150572260075153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21510322867886.
The product of its (nonzero) digits is 2205000, while the sum is 49.
The spelling of 150572260075153 in words is "one hundred fifty trillion, five hundred seventy-two billion, two hundred sixty million, seventy-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •