Base | Representation |
---|---|
bin | 100010001010000011111100… |
… | …101000000101110110000111 |
3 | 201200220101000112222101212120 |
4 | 202022003330220011312013 |
5 | 124142241312203404111 |
6 | 1251300230254021023 |
7 | 43433253621435663 |
oct | 4212037450056607 |
9 | 650811015871776 |
10 | 150225014513031 |
11 | 43959086375327 |
12 | 14a227454a7773 |
13 | 65a9209403393 |
14 | 2914d027818a3 |
15 | 1257a6d991406 |
hex | 88a0fca05d87 |
150225014513031 has 8 divisors (see below), whose sum is σ = 200300339510640. Its totient is φ = 100149849595392.
The previous prime is 150225014512997. The next prime is 150225014513083. The reversal of 150225014513031 is 130315410522051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 150225014513031 - 29 = 150225014512519 is a prime.
It is a super-2 number, since 2×1502250145130312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150225014512983 and 150225014513001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150225014513831) 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, 37812916 + ... + 41596473.
It is an arithmetic number, because the mean of its divisors is an integer number (25037542438830).
Almost surely, 2150225014513031 is an apocalyptic number.
150225014513031 is a deficient number, since it is larger than the sum of its proper divisors (50075324997609).
150225014513031 is an equidigital number, since it uses as much as digits as its factorization.
150225014513031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80039985.
The product of its (nonzero) digits is 18000, while the sum is 33.
The spelling of 150225014513031 in words is "one hundred fifty trillion, two hundred twenty-five billion, fourteen million, five hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •