Base | Representation |
---|---|
bin | 10100110111001111110100… |
… | …00000000010000011111111 |
3 | 20000102222001021101101001111 |
4 | 22123213322000002003333 |
5 | 22003134124420013043 |
6 | 241324222512422451 |
7 | 12443425642423126 |
oct | 1233477200020377 |
9 | 200388037341044 |
10 | 45878740001023 |
11 | 13689078746536 |
12 | 518b735247a27 |
13 | 1c7a46769c377 |
14 | b48785894abd |
15 | 5486282b109d |
hex | 29b9fa0020ff |
45878740001023 has 2 divisors, whose sum is σ = 45878740001024. Its totient is φ = 45878740001022.
The previous prime is 45878740000987. The next prime is 45878740001027. The reversal of 45878740001023 is 32010004787854.
45878740001023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-45878740001023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45878740001027) 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, 22939370000511 + 22939370000512.
It is an arithmetic number, because the mean of its divisors is an integer number (22939370000512).
Almost surely, 245878740001023 is an apocalyptic number.
45878740001023 is a deficient number, since it is larger than the sum of its proper divisors (1).
45878740001023 is an equidigital number, since it uses as much as digits as its factorization.
45878740001023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1505280, while the sum is 49.
Adding to 45878740001023 its reverse (32010004787854), we get a palindrome (77888744788877).
The spelling of 45878740001023 in words is "forty-five trillion, eight hundred seventy-eight billion, seven hundred forty million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •