Base | Representation |
---|---|
bin | 10100100110011110010011… |
… | …01000111100010100001111 |
3 | 12221101212102100200102212222 |
4 | 22103033021220330110033 |
5 | 21414213310133233033 |
6 | 240203345303045555 |
7 | 12353663531101526 |
oct | 1223171150742417 |
9 | 187355370612788 |
10 | 45302403024143 |
11 | 134867065264a1 |
12 | 50b7aab1408bb |
13 | 1c37cc92948b5 |
14 | b289101ad4bd |
15 | 538645a6e598 |
hex | 2933c9a3c50f |
45302403024143 has 2 divisors, whose sum is σ = 45302403024144. Its totient is φ = 45302403024142.
The previous prime is 45302403024133. The next prime is 45302403024217. The reversal of 45302403024143 is 34142030420354.
45302403024143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 45302403024143 - 24 = 45302403024127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45302403024133) by changing a digit.
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 as a sum of consecutive naturals, namely, 22651201512071 + 22651201512072.
It is an arithmetic number, because the mean of its divisors is an integer number (22651201512072).
Almost surely, 245302403024143 is an apocalyptic number.
45302403024143 is a deficient number, since it is larger than the sum of its proper divisors (1).
45302403024143 is an equidigital number, since it uses as much as digits as its factorization.
45302403024143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 35.
Adding to 45302403024143 its reverse (34142030420354), we get a palindrome (79444433444497).
The spelling of 45302403024143 in words is "forty-five trillion, three hundred two billion, four hundred three million, twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •