Base | Representation |
---|---|
bin | 1000011100100011010… |
… | …1101101101010001101 |
3 | 111212112111201201122122 |
4 | 2013020311231222031 |
5 | 4334132440211441 |
6 | 150354250222325 |
7 | 13324540633412 |
oct | 2071065555215 |
9 | 455474651578 |
10 | 145103444621 |
11 | 565a1125673 |
12 | 24156a249a5 |
13 | 108b5c9c205 |
14 | 704733a109 |
15 | 3b93cad34b |
hex | 21c8d6da8d |
145103444621 has 16 divisors (see below), whose sum is σ = 147282345600. Its totient is φ = 142940472768.
The previous prime is 145103444611. The next prime is 145103444639. The reversal of 145103444621 is 126444301541.
145103444621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 145103444621 - 230 = 144029702797 is a prime.
It is a super-2 number, since 2×1451034446212 (a number of 23 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 (145103444611) 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 15 ways as a sum of consecutive naturals, for example, 41826875 + ... + 41830343.
It is an arithmetic number, because the mean of its divisors is an integer number (9205146600).
Almost surely, 2145103444621 is an apocalyptic number.
It is an amenable number.
145103444621 is a deficient number, since it is larger than the sum of its proper divisors (2178900979).
145103444621 is a wasteful number, since it uses less digits than its factorization.
145103444621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5588.
The product of its (nonzero) digits is 46080, while the sum is 35.
The spelling of 145103444621 in words is "one hundred forty-five billion, one hundred three million, four hundred forty-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •