Base | Representation |
---|---|
bin | 1000101110111100000… |
… | …0100001101011010111 |
3 | 112100021110102202220020 |
4 | 2023233000201223113 |
5 | 4424234411440011 |
6 | 152532111440223 |
7 | 13561046410215 |
oct | 2135700415327 |
9 | 470243382806 |
10 | 150038780631 |
11 | 586a3a86663 |
12 | 250b3826073 |
13 | 111c1609c8c |
14 | 73949a7cb5 |
15 | 3d821e0006 |
hex | 22ef021ad7 |
150038780631 has 8 divisors (see below), whose sum is σ = 200090133360. Its totient is φ = 100006640832.
The previous prime is 150038780603. The next prime is 150038780657. The reversal of 150038780631 is 136087830051.
150038780631 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 not a de Polignac number, because 150038780631 - 210 = 150038779607 is a prime.
It is a super-2 number, since 2×1500387806312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150038780431) 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, 4785000 + ... + 4816253.
It is an arithmetic number, because the mean of its divisors is an integer number (25011266670).
Almost surely, 2150038780631 is an apocalyptic number.
150038780631 is a deficient number, since it is larger than the sum of its proper divisors (50051352729).
150038780631 is an equidigital number, since it uses as much as digits as its factorization.
150038780631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9606465.
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 150038780631 in words is "one hundred fifty billion, thirty-eight million, seven hundred eighty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •