Base | Representation |
---|---|
bin | 1000011100010011010… |
… | …1010011000001011011 |
3 | 111212100211020200221012 |
4 | 2013010311103001123 |
5 | 4334013233223101 |
6 | 150343445404135 |
7 | 13323063404561 |
oct | 2070465230133 |
9 | 455324220835 |
10 | 145036226651 |
11 | 56567194828 |
12 | 2413840964b |
13 | 108a5095a74 |
14 | 703c43da31 |
15 | 3b8ce31bbb |
hex | 21c4d5305b |
145036226651 has 2 divisors, whose sum is σ = 145036226652. Its totient is φ = 145036226650.
The previous prime is 145036226641. The next prime is 145036226659. The reversal of 145036226651 is 156622630541.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145036226651 - 222 = 145032032347 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145036226599 and 145036226608.
It is not a weakly prime, because it can be changed into another prime (145036226659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72518113325 + 72518113326.
It is an arithmetic number, because the mean of its divisors is an integer number (72518113326).
Almost surely, 2145036226651 is an apocalyptic number.
145036226651 is a deficient number, since it is larger than the sum of its proper divisors (1).
145036226651 is an equidigital number, since it uses as much as digits as its factorization.
145036226651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 145036226651 in words is "one hundred forty-five billion, thirty-six million, two hundred twenty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •