Base | Representation |
---|---|
bin | 1000011100100011010… |
… | …1010001101110101110 |
3 | 111212112111111220201122 |
4 | 2013020311101232232 |
5 | 4334132423031342 |
6 | 150354243540542 |
7 | 13324536646034 |
oct | 2071065215656 |
9 | 455474456648 |
10 | 145103330222 |
11 | 565a1057724 |
12 | 2415698a752 |
13 | 108b5c5c116 |
14 | 704730a554 |
15 | 3b93c894d2 |
hex | 21c8d51bae |
145103330222 has 8 divisors (see below), whose sum is σ = 217697579616. Its totient is φ = 72537470352.
The previous prime is 145103330147. The next prime is 145103330227. The reversal of 145103330222 is 222033301541.
It is a happy number.
145103330222 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 a junction number, because it is equal to n+sod(n) for n = 145103330191 and 145103330200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145103330227) 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 3 ways as a sum of consecutive naturals, for example, 7084598 + ... + 7105049.
It is an arithmetic number, because the mean of its divisors is an integer number (27212197452).
Almost surely, 2145103330222 is an apocalyptic number.
145103330222 is a deficient number, since it is larger than the sum of its proper divisors (72594249394).
145103330222 is a wasteful number, since it uses less digits than its factorization.
145103330222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14194762.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 145103330222 its reverse (222033301541), we get a palindrome (367136631763).
The spelling of 145103330222 in words is "one hundred forty-five billion, one hundred three million, three hundred thirty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •