Base | Representation |
---|---|
bin | 100001000000001111100100… |
… | …011100011111001100000001 |
3 | 201000221102100001012001112110 |
4 | 201000033210130133030001 |
5 | 123011133303111110340 |
6 | 1232414005121445533 |
7 | 42400622062324662 |
oct | 4100174434371401 |
9 | 630842301161473 |
10 | 145152252441345 |
11 | 422827a7434426 |
12 | 1434358b7a08a9 |
13 | 62cba4c8b7136 |
14 | 27bb599633369 |
15 | 11bab23417680 |
hex | 8403e471f301 |
145152252441345 has 32 divisors (see below), whose sum is σ = 244469323238400. Its totient is φ = 73339373916864.
The previous prime is 145152252441337. The next prime is 145152252441359. The reversal of 145152252441345 is 543144252251541.
It is a happy number.
It is not a de Polignac number, because 145152252441345 - 23 = 145152252441337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145152252441294 and 145152252441303.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27597994 + ... + 32433836.
It is an arithmetic number, because the mean of its divisors is an integer number (7639666351200).
Almost surely, 2145152252441345 is an apocalyptic number.
145152252441345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
145152252441345 is a deficient number, since it is larger than the sum of its proper divisors (99317070797055).
145152252441345 is a wasteful number, since it uses less digits than its factorization.
145152252441345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4941189.
The product of its digits is 3840000, while the sum is 48.
The spelling of 145152252441345 in words is "one hundred forty-five trillion, one hundred fifty-two billion, two hundred fifty-two million, four hundred forty-one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •