Base | Representation |
---|---|
bin | 100010000111001111010001… |
… | …010101001010110011110111 |
3 | 201200012211021100220220212110 |
4 | 202013033101111022303313 |
5 | 124131102004214312043 |
6 | 1251031144022422103 |
7 | 43413245255426430 |
oct | 4207172125126367 |
9 | 650184240826773 |
10 | 150031014604023 |
11 | 43893883497313 |
12 | 149b1023291933 |
13 | 6593b301b2507 |
14 | 290977b4d4487 |
15 | 12529b7171b33 |
hex | 8873d154acf7 |
150031014604023 has 8 divisors (see below), whose sum is σ = 228618688920448. Its totient is φ = 85732008345144.
The previous prime is 150031014604019. The next prime is 150031014604057. The reversal of 150031014604023 is 320406410130051.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 150031014604023 - 22 = 150031014604019 is a prime.
It is a super-2 number, since 2×1500310146040232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150031014604013) 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, 3572167014361 + ... + 3572167014402.
It is an arithmetic number, because the mean of its divisors is an integer number (28577336115056).
Almost surely, 2150031014604023 is an apocalyptic number.
150031014604023 is a deficient number, since it is larger than the sum of its proper divisors (78587674316425).
150031014604023 is an equidigital number, since it uses as much as digits as its factorization.
150031014604023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7144334028773.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 150031014604023 its reverse (320406410130051), we get a palindrome (470437424734074).
The spelling of 150031014604023 in words is "one hundred fifty trillion, thirty-one billion, fourteen million, six hundred four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •