Base | Representation |
---|---|
bin | 100001000010011101001110… |
… | …011110100001111001110111 |
3 | 201001110221221100101122100101 |
4 | 201002131032132201321313 |
5 | 123021131304413421030 |
6 | 1233011522124054531 |
7 | 42414615243513361 |
oct | 4102351636417167 |
9 | 631427840348311 |
10 | 145304355217015 |
11 | 4233125a497005 |
12 | 14368b5a694447 |
13 | 63101ac9b6947 |
14 | 27c4aa8393d31 |
15 | 11bea7690b7ca |
hex | 84274e7a1e77 |
145304355217015 has 32 divisors (see below), whose sum is σ = 187884905310720. Its totient is φ = 107659007193600.
The previous prime is 145304355216997. The next prime is 145304355217067. The reversal of 145304355217015 is 510712553403541.
It is not a de Polignac number, because 145304355217015 - 27 = 145304355216887 is a prime.
It is a super-2 number, since 2×1453043552170152 (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 31 ways as a sum of consecutive naturals, for example, 207325720 + ... + 208025389.
It is an arithmetic number, because the mean of its divisors is an integer number (5871403290960).
Almost surely, 2145304355217015 is an apocalyptic number.
145304355217015 is a deficient number, since it is larger than the sum of its proper divisors (42580550093705).
145304355217015 is a wasteful number, since it uses less digits than its factorization.
145304355217015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415351243.
The product of its (nonzero) digits is 1260000, while the sum is 46.
The spelling of 145304355217015 in words is "one hundred forty-five trillion, three hundred four billion, three hundred fifty-five million, two hundred seventeen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •