Base | Representation |
---|---|
bin | 100001000010111010111010… |
… | …001001010000110100011111 |
3 | 201001121000012111120001221121 |
4 | 201002322322021100310133 |
5 | 123022142042421234130 |
6 | 1233034312441111411 |
7 | 42420124113632440 |
oct | 4102727211206437 |
9 | 631530174501847 |
10 | 145336226352415 |
11 | 4234382496082a |
12 | 14373174188567 |
13 | 63131bb917347 |
14 | 27c644d1112c7 |
15 | 11c07de940d7a |
hex | 842eba250d1f |
145336226352415 has 32 divisors (see below), whose sum is σ = 202562520090624. Its totient is φ = 98040954528000.
The previous prime is 145336226352413. The next prime is 145336226352461. The reversal of 145336226352415 is 514253622633541.
It is not a de Polignac number, because 145336226352415 - 21 = 145336226352413 is a prime.
It is a super-2 number, since 2×1453362263524152 (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 (145336226352413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39501934 + ... + 43024123.
It is an arithmetic number, because the mean of its divisors is an integer number (6330078752832).
Almost surely, 2145336226352415 is an apocalyptic number.
145336226352415 is a deficient number, since it is larger than the sum of its proper divisors (57226293738209).
145336226352415 is an equidigital number, since it uses as much as digits as its factorization.
145336226352415 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82526887.
The product of its digits is 15552000, while the sum is 52.
Adding to 145336226352415 its reverse (514253622633541), we get a palindrome (659589848985956).
The spelling of 145336226352415 in words is "one hundred forty-five trillion, three hundred thirty-six billion, two hundred twenty-six million, three hundred fifty-two thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •