Base | Representation |
---|---|
bin | 100001000001101011110111… |
… | …011011100100000110101100 |
3 | 201001021220010200112112121002 |
4 | 201001223313123210012230 |
5 | 123014244233413324002 |
6 | 1232531315034055432 |
7 | 42411030663104030 |
oct | 4101536733440654 |
9 | 631256120475532 |
10 | 145251355214252 |
11 | 42310832361531 |
12 | 1435a828b7a578 |
13 | 63081b4561371 |
14 | 27c22bb45a1c0 |
15 | 11bd4c39c2002 |
hex | 841af76e41ac |
145251355214252 has 48 divisors (see below), whose sum is σ = 295138836679680. Its totient is φ = 61260366484800.
The previous prime is 145251355214239. The next prime is 145251355214279. The reversal of 145251355214252 is 252412553152541.
It is a junction number, because it is equal to n+sod(n) for n = 145251355214197 and 145251355214206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66451352 + ... + 68602367.
It is an arithmetic number, because the mean of its divisors is an integer number (6148725764160).
Almost surely, 2145251355214252 is an apocalyptic number.
It is an amenable number.
145251355214252 is an abundant number, since it is smaller than the sum of its proper divisors (149887481465428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145251355214252 is a wasteful number, since it uses less digits than its factorization.
145251355214252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135054342 (or 135054340 counting only the distinct ones).
The product of its digits is 2400000, while the sum is 47.
The spelling of 145251355214252 in words is "one hundred forty-five trillion, two hundred fifty-one billion, three hundred fifty-five million, two hundred fourteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •