Base | Representation |
---|---|
bin | 1000011100010000001… |
… | …1011000101011011101 |
3 | 111212022220121222000111 |
4 | 2013010003120223131 |
5 | 4334001411030441 |
6 | 150342301130021 |
7 | 13322544241660 |
oct | 2070403305335 |
9 | 455286558014 |
10 | 145023142621 |
11 | 5655a868585 |
12 | 24133b59911 |
13 | 108a2464536 |
14 | 703a7d56d7 |
15 | 3b8bbea081 |
hex | 21c40d8add |
145023142621 has 32 divisors (see below), whose sum is σ = 178646630400. Its totient is φ = 114987565440.
The previous prime is 145023142591. The next prime is 145023142631. The reversal of 145023142621 is 126241320541.
It is a cyclic number.
It is not a de Polignac number, because 145023142621 - 29 = 145023142109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145023142631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8021490 + ... + 8039548.
It is an arithmetic number, because the mean of its divisors is an integer number (5582707200).
Almost surely, 2145023142621 is an apocalyptic number.
It is an amenable number.
145023142621 is a deficient number, since it is larger than the sum of its proper divisors (33623487779).
145023142621 is a wasteful number, since it uses less digits than its factorization.
145023142621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19729.
The product of its (nonzero) digits is 11520, while the sum is 31.
The spelling of 145023142621 in words is "one hundred forty-five billion, twenty-three million, one hundred forty-two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •