Base | Representation |
---|---|
bin | 100001000010110111010000… |
… | …111001100101001001110001 |
3 | 201001120122002210011210111020 |
4 | 201002313100321211021301 |
5 | 123022111034131300230 |
6 | 1233032424251410053 |
7 | 42416625126153306 |
oct | 4102672071451161 |
9 | 631518083153436 |
10 | 145332313150065 |
11 | 423420a6a709a8 |
12 | 14372461753929 |
13 | 6312a16c960b2 |
14 | 27c619b5130ad |
15 | 11c0661113810 |
hex | 842dd0e65271 |
145332313150065 has 16 divisors (see below), whose sum is σ = 234833995112256. Its totient is φ = 76743135656000.
The previous prime is 145332313150033. The next prime is 145332313150081. The reversal of 145332313150065 is 560051313233541.
It is not a de Polignac number, because 145332313150065 - 25 = 145332313150033 is a prime.
It is a super-2 number, since 2×1453323131500652 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 145332313149999 and 145332313150026.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47964458271 + ... + 47964461300.
It is an arithmetic number, because the mean of its divisors is an integer number (14677124694516).
Almost surely, 2145332313150065 is an apocalyptic number.
145332313150065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
145332313150065 is a deficient number, since it is larger than the sum of its proper divisors (89501681962191).
145332313150065 is a wasteful number, since it uses less digits than its factorization.
145332313150065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95928919680.
The product of its (nonzero) digits is 486000, while the sum is 42.
The spelling of 145332313150065 in words is "one hundred forty-five trillion, three hundred thirty-two billion, three hundred thirteen million, one hundred fifty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •