Base | Representation |
---|---|
bin | 100000111110100000110010… |
… | …010101111000110110100110 |
3 | 201000112001022001122122022210 |
4 | 200332200302111320312212 |
5 | 123002211144331000042 |
6 | 1232243213415304250 |
7 | 42356211245353242 |
oct | 4076406225706646 |
9 | 630461261578283 |
10 | 145033300250022 |
11 | 42237305a87498 |
12 | 1432451297b086 |
13 | 62c0773808b02 |
14 | 27b5913521422 |
15 | 11b79b0438a9c |
hex | 83e832578da6 |
145033300250022 has 16 divisors (see below), whose sum is σ = 290258570472192. Its totient is φ = 48312438421320.
The previous prime is 145033300250021. The next prime is 145033300250029. The reversal of 145033300250022 is 220052003330541.
It is a super-2 number, since 2×1450333002500222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145033300250021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7998739018 + ... + 7998757149.
It is an arithmetic number, because the mean of its divisors is an integer number (18141160654512).
Almost surely, 2145033300250022 is an apocalyptic number.
145033300250022 is an abundant number, since it is smaller than the sum of its proper divisors (145225270222170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145033300250022 is a wasteful number, since it uses less digits than its factorization.
145033300250022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15997497683.
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 145033300250022 its reverse (220052003330541), we get a palindrome (365085303580563).
The spelling of 145033300250022 in words is "one hundred forty-five trillion, thirty-three billion, three hundred million, two hundred fifty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •