Base | Representation |
---|---|
bin | 100010001000011001110001… |
… | …000101011100111110010001 |
3 | 201200111110201222112221211010 |
4 | 202020121301011130332101 |
5 | 124133404314042000001 |
6 | 1251132013210241133 |
7 | 43422106423255404 |
oct | 4210316105347621 |
9 | 650443658487733 |
10 | 150111004250001 |
11 | 439147a0571253 |
12 | 14a046277261a9 |
13 | 659b53a130592 |
14 | 290d5a8b35d3b |
15 | 1254ae97978d6 |
hex | 88867115cf91 |
150111004250001 has 8 divisors (see below), whose sum is σ = 200187851994880. Its totient is φ = 100054079669232.
The previous prime is 150111004249963. The next prime is 150111004250017. The reversal of 150111004250001 is 100052400111051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 150111004250001 - 221 = 150111002152849 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150111004250001.
It is not an unprimeable number, because it can be changed into a prime (150111004150001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4980773446 + ... + 4980803583.
It is an arithmetic number, because the mean of its divisors is an integer number (25023481499360).
Almost surely, 2150111004250001 is an apocalyptic number.
It is an amenable number.
150111004250001 is a deficient number, since it is larger than the sum of its proper divisors (50076847744879).
150111004250001 is an equidigital number, since it uses as much as digits as its factorization.
150111004250001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9961582055.
The product of its (nonzero) digits is 200, while the sum is 21.
Adding to 150111004250001 its reverse (100052400111051), we get a palindrome (250163404361052).
The spelling of 150111004250001 in words is "one hundred fifty trillion, one hundred eleven billion, four million, two hundred fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •