Base | Representation |
---|---|
bin | 1000011100111011100… |
… | …1100000011101011010 |
3 | 111212210121000110221112 |
4 | 2013032321200131122 |
5 | 4334340001234201 |
6 | 150412321140322 |
7 | 13330214002016 |
oct | 2071671403532 |
9 | 455717013845 |
10 | 145205102426 |
11 | 5664354968a |
12 | 24184a8a6a2 |
13 | 10901073467 |
14 | 7056a3d546 |
15 | 3b9cb8e0bb |
hex | 21cee6075a |
145205102426 has 8 divisors (see below), whose sum is σ = 217841074164. Its totient is φ = 72591411040.
The previous prime is 145205102423. The next prime is 145205102477. The reversal of 145205102426 is 624201502541.
145205102426 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 104910562201 + 40294540225 = 323899^2 + 200735^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 145205102392 and 145205102401.
It is not an unprimeable number, because it can be changed into a prime (145205102423) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 5553785 + ... + 5579868.
Almost surely, 2145205102426 is an apocalyptic number.
145205102426 is a deficient number, since it is larger than the sum of its proper divisors (72635971738).
145205102426 is a wasteful number, since it uses less digits than its factorization.
145205102426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11140176.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 145205102426 its reverse (624201502541), we get a palindrome (769406604967).
The spelling of 145205102426 in words is "one hundred forty-five billion, two hundred five million, one hundred two thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •