Base | Representation |
---|---|
bin | 10100101111111001111000… |
… | …10110100100100110100101 |
3 | 12222112211211202111021220121 |
4 | 22113330330112210212211 |
5 | 21440020432213313321 |
6 | 241012300221201541 |
7 | 12416254653101356 |
oct | 1227747426444645 |
9 | 188484752437817 |
10 | 45626450135461 |
11 | 135a1083693408 |
12 | 514a865a002b1 |
13 | 1c5c72c0a6150 |
14 | b3a490cd1d2d |
15 | 541cae428441 |
hex | 297f3c5a49a5 |
45626450135461 has 16 divisors (see below), whose sum is σ = 49458253310704. Its totient is φ = 41840756665344.
The previous prime is 45626450135423. The next prime is 45626450135471. The reversal of 45626450135461 is 16453105462654.
It can be written as a sum of positive squares in 8 ways, for example, as 9794433715236 + 35832016420225 = 3129606^2 + 5985985^2 .
It is not a de Polignac number, because 45626450135461 - 215 = 45626450102693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45626450135399 and 45626450135408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45626450135471) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9041101 + ... + 13152733.
It is an arithmetic number, because the mean of its divisors is an integer number (3091140831919).
Almost surely, 245626450135461 is an apocalyptic number.
It is an amenable number.
45626450135461 is a deficient number, since it is larger than the sum of its proper divisors (3831803175243).
45626450135461 is a wasteful number, since it uses less digits than its factorization.
45626450135461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4117240.
The product of its (nonzero) digits is 10368000, while the sum is 52.
The spelling of 45626450135461 in words is "forty-five trillion, six hundred twenty-six billion, four hundred fifty million, one hundred thirty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •