Base | Representation |
---|---|
bin | 100010010110110011110111… |
… | …111111001001110101101001 |
3 | 201211000010101011012110021111 |
4 | 202112303313333021311221 |
5 | 124301120033130013001 |
6 | 1253210520332510321 |
7 | 43553460236266426 |
oct | 4226636777116551 |
9 | 654003334173244 |
10 | 151101110001001 |
11 | 44166691441456 |
12 | 14b444a801b3a1 |
13 | 6640a095b6cc4 |
14 | 29454930a6d4d |
15 | 127074758e851 |
hex | 896cf7fc9d69 |
151101110001001 has 8 divisors (see below), whose sum is σ = 156131784061184. Its totient is φ = 146080213734960.
The previous prime is 151101110000987. The next prime is 151101110001053. The reversal of 151101110001001 is 100100011101151.
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 151101110001001 - 27 = 151101110000873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (151161110001001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2444417115 + ... + 2444478928.
It is an arithmetic number, because the mean of its divisors is an integer number (19516473007648).
Almost surely, 2151101110001001 is an apocalyptic number.
It is an amenable number.
151101110001001 is a deficient number, since it is larger than the sum of its proper divisors (5030674060183).
151101110001001 is an equidigital number, since it uses as much as digits as its factorization.
151101110001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4888897071.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 151101110001001 its reverse (100100011101151), we get a palindrome (251201121102152).
The spelling of 151101110001001 in words is "one hundred fifty-one trillion, one hundred one billion, one hundred ten million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •