Base | Representation |
---|---|
bin | 100001000111111000100001… |
… | …000011000001011111111110 |
3 | 201002210121110101110211010201 |
4 | 201013320201003001133332 |
5 | 123043234004311431210 |
6 | 1233455112424354114 |
7 | 42453556121121022 |
oct | 4107704103013776 |
9 | 632717411424121 |
10 | 145677255186430 |
11 | 42465416833310 |
12 | 1440928a01593a |
13 | 63393c99bca16 |
14 | 27d8b61316382 |
15 | 11c95ee0b153a |
hex | 847e210c17fe |
145677255186430 has 32 divisors (see below), whose sum is σ = 286088895870048. Its totient is φ = 52967669520000.
The previous prime is 145677255186317. The next prime is 145677255186433. The reversal of 145677255186430 is 34681552776541.
It is a happy number.
It is a super-2 number, since 2×1456772551864302 (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 (145677255186433) 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 15 ways as a sum of consecutive naturals, for example, 72476821 + ... + 74459680.
It is an arithmetic number, because the mean of its divisors is an integer number (8940277995939).
Almost surely, 2145677255186430 is an apocalyptic number.
145677255186430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145677255186430 is a deficient number, since it is larger than the sum of its proper divisors (140411640683618).
145677255186430 is a wasteful number, since it uses less digits than its factorization.
145677255186430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146945532.
The product of its (nonzero) digits is 169344000, while the sum is 64.
The spelling of 145677255186430 in words is "one hundred forty-five trillion, six hundred seventy-seven billion, two hundred fifty-five million, one hundred eighty-six thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •