Base | Representation |
---|---|
bin | 100001000001110100001001… |
… | …111010001011111111101101 |
3 | 201001022202002221100221211002 |
4 | 201001310021322023333231 |
5 | 123014421000310311240 |
6 | 1232535350123010045 |
7 | 42411464352333356 |
oct | 4101641172137755 |
9 | 631282087327732 |
10 | 145260255166445 |
11 | 4231458a129321 |
12 | 143604b1669925 |
13 | 6308ca2382173 |
14 | 27c28c346ad2d |
15 | 11bd844ed9d15 |
hex | 841d09e8bfed |
145260255166445 has 32 divisors (see below), whose sum is σ = 175080776382720. Its totient is φ = 115696631232000.
The previous prime is 145260255166423. The next prime is 145260255166561. The reversal of 145260255166445 is 544661552062541.
It is not a de Polignac number, because 145260255166445 - 234 = 145243075297261 is a prime.
It is a super-2 number, since 2×1452602551664452 (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, 13793580830 + ... + 13793591360.
It is an arithmetic number, because the mean of its divisors is an integer number (5471274261960).
Almost surely, 2145260255166445 is an apocalyptic number.
It is an amenable number.
145260255166445 is a deficient number, since it is larger than the sum of its proper divisors (29820521216275).
145260255166445 is a wasteful number, since it uses less digits than its factorization.
145260255166445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18197.
The product of its (nonzero) digits is 34560000, while the sum is 56.
The spelling of 145260255166445 in words is "one hundred forty-five trillion, two hundred sixty billion, two hundred fifty-five million, one hundred sixty-six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •