Base | Representation |
---|---|
bin | 100000111110010100101011… |
… | …110010000110001000100011 |
3 | 201000110210202102100212221111 |
4 | 200332110223302012020203 |
5 | 123002003041124131201 |
6 | 1232233224124404151 |
7 | 42355241233206454 |
oct | 4076245362061043 |
9 | 630423672325844 |
10 | 145020305302051 |
11 | 42231847742773 |
12 | 14321aa69a6657 |
13 | 62bc4824b579a |
14 | 27b503d70d12b |
15 | 11b749e683b51 |
hex | 83e52bc86223 |
145020305302051 has 8 divisors (see below), whose sum is σ = 146459499115824. Its totient is φ = 143581177159200.
The previous prime is 145020305301997. The next prime is 145020305302129. The reversal of 145020305302051 is 150203503020541.
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 145020305302051 - 29 = 145020305301539 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145020305302451) 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, 11973300 + ... + 20818273.
It is an arithmetic number, because the mean of its divisors is an integer number (18307437389478).
Almost surely, 2145020305302051 is an apocalyptic number.
145020305302051 is a deficient number, since it is larger than the sum of its proper divisors (1439193813773).
145020305302051 is a wasteful number, since it uses less digits than its factorization.
145020305302051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32835461.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 145020305302051 its reverse (150203503020541), we get a palindrome (295223808322592).
The spelling of 145020305302051 in words is "one hundred forty-five trillion, twenty billion, three hundred five million, three hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •