Base | Representation |
---|---|
bin | 1000101111100010101… |
… | …1010111011000100001 |
3 | 112100200202200122201110 |
4 | 2023320223113120201 |
5 | 4430102424134401 |
6 | 153000144453533 |
7 | 13565056324263 |
oct | 2137053273041 |
9 | 470622618643 |
10 | 150201005601 |
11 | 58777608689 |
12 | 2513a01a2a9 |
13 | 112190c939a |
14 | 73ac355b33 |
15 | 3d915869d6 |
hex | 22f8ad7621 |
150201005601 has 8 divisors (see below), whose sum is σ = 205152593184. Its totient is φ = 97691710880.
The previous prime is 150201005579. The next prime is 150201005611. The reversal of 150201005601 is 106500102051.
150201005601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 150201005601 - 213 = 150200997409 is a prime.
It is not an unprimeable number, because it can be changed into a prime (150201005611) 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 7 ways as a sum of consecutive naturals, for example, 610573071 + ... + 610573316.
It is an arithmetic number, because the mean of its divisors is an integer number (25644074148).
Almost surely, 2150201005601 is an apocalyptic number.
It is an amenable number.
150201005601 is a deficient number, since it is larger than the sum of its proper divisors (54951587583).
150201005601 is a wasteful number, since it uses less digits than its factorization.
150201005601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1221146431.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 150201005601 its reverse (106500102051), we get a palindrome (256701107652).
The spelling of 150201005601 in words is "one hundred fifty billion, two hundred one million, five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •