Base | Representation |
---|---|
bin | 100001001011011101001110… |
… | …111011110111000100010101 |
3 | 201010200002100111020100011101 |
4 | 201023131032323313010111 |
5 | 123111244433034242001 |
6 | 1234204005412510101 |
7 | 42510401651221102 |
oct | 4113351673670425 |
9 | 633602314210141 |
10 | 145922838196501 |
11 | 4254a589a63663 |
12 | 144489a731b331 |
13 | 635660694a5b2 |
14 | 28069bb269aa9 |
15 | 11d0bc4237a01 |
hex | 84b74eef7115 |
145922838196501 has 8 divisors (see below), whose sum is σ = 148260210649920. Its totient is φ = 143590154556288.
The previous prime is 145922838196409. The next prime is 145922838196519. The reversal of 145922838196501 is 105691838229541.
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 145922838196501 - 221 = 145922836099349 is a prime.
It is a super-2 number, since 2×1459228381965012 (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 (145922838196561) 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, 1172140561 + ... + 1172265046.
It is an arithmetic number, because the mean of its divisors is an integer number (18532526331240).
Almost surely, 2145922838196501 is an apocalyptic number.
It is an amenable number.
145922838196501 is a deficient number, since it is larger than the sum of its proper divisors (2337372453419).
145922838196501 is an equidigital number, since it uses as much as digits as its factorization.
145922838196501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2344406603.
The product of its (nonzero) digits is 37324800, while the sum is 64.
The spelling of 145922838196501 in words is "one hundred forty-five trillion, nine hundred twenty-two billion, eight hundred thirty-eight million, one hundred ninety-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •