Base | Representation |
---|---|
bin | 100001000010011110000010… |
… | …010001111010100101001111 |
3 | 201001111001011220202220222212 |
4 | 201002132002101322211033 |
5 | 123021140044411403310 |
6 | 1233012144252101035 |
7 | 42414645626021255 |
oct | 4102360221724517 |
9 | 631431156686885 |
10 | 145305224325455 |
11 | 4233166603a047 |
12 | 1436916176477b |
13 | 63102baa855ac |
14 | 27c4b4b98c5d5 |
15 | 11beac7d85205 |
hex | 84278247a94f |
145305224325455 has 16 divisors (see below), whose sum is σ = 174387176964000. Its totient is φ = 116230241848320.
The previous prime is 145305224325427. The next prime is 145305224325497. The reversal of 145305224325455 is 554523422503541.
It is not a de Polignac number, because 145305224325455 - 214 = 145305224309071 is a prime.
It is a super-2 number, since 2×1453052243254552 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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, 2137467656 + ... + 2137535634.
It is an arithmetic number, because the mean of its divisors is an integer number (10899198560250).
Almost surely, 2145305224325455 is an apocalyptic number.
145305224325455 is a deficient number, since it is larger than the sum of its proper divisors (29081952638545).
145305224325455 is a wasteful number, since it uses less digits than its factorization.
145305224325455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112954.
The product of its (nonzero) digits is 14400000, while the sum is 50.
Adding to 145305224325455 its reverse (554523422503541), we get a palindrome (699828646828996).
The spelling of 145305224325455 in words is "one hundred forty-five trillion, three hundred five billion, two hundred twenty-four million, three hundred twenty-five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •