Base | Representation |
---|---|
bin | 1000101111011010001… |
… | …0010000110100101001 |
3 | 112100121021001200111010 |
4 | 2023312202100310221 |
5 | 4430014224040001 |
6 | 152552422254133 |
7 | 13564141664220 |
oct | 2136642206451 |
9 | 470537050433 |
10 | 150165065001 |
11 | 5875929aa06 |
12 | 25129b87349 |
13 | 11211824463 |
14 | 73a767bcb7 |
15 | 3d8d3378d6 |
hex | 22f6890d29 |
150165065001 has 64 divisors (see below), whose sum is σ = 240292233216. Its totient is φ = 81626227200.
The previous prime is 150165064999. The next prime is 150165065021. The reversal of 150165065001 is 100560561051.
It is not a de Polignac number, because 150165065001 - 21 = 150165064999 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 150165065001.
It is not an unprimeable number, because it can be changed into a prime (150165065021) 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 63 ways as a sum of consecutive naturals, for example, 10959711 + ... + 10973403.
It is an arithmetic number, because the mean of its divisors is an integer number (3754566144).
Almost surely, 2150165065001 is an apocalyptic number.
It is an amenable number.
150165065001 is a deficient number, since it is larger than the sum of its proper divisors (90127168215).
150165065001 is a wasteful number, since it uses less digits than its factorization.
150165065001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14062.
The product of its (nonzero) digits is 4500, while the sum is 30.
It can be divided in two parts, 1501650 and 65001, that added together give a palindrome (1566651).
The spelling of 150165065001 in words is "one hundred fifty billion, one hundred sixty-five million, sixty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •