Base | Representation |
---|---|
bin | 100001101001011101000… |
… | …110100111110111101001 |
3 | 22012001022222122001010101 |
4 | 201221131012213313221 |
5 | 300340444113010010 |
6 | 4530122432545401 |
7 | 326024551205626 |
oct | 41513506476751 |
9 | 8161288561111 |
10 | 2312254422505 |
11 | 811692383095 |
12 | 3141693b2261 |
13 | 13a077158151 |
14 | 7dcb131b34d |
15 | 4023141673a |
hex | 21a5d1a7de9 |
2312254422505 has 16 divisors (see below), whose sum is σ = 2827225327248. Its totient is φ = 1814941440000.
The previous prime is 2312254422503. The next prime is 2312254422521. The reversal of 2312254422505 is 5052244522132.
It can be written as a sum of positive squares in 8 ways, for example, as 213432912144 + 2098821510361 = 461988^2 + 1448731^2 .
It is not a de Polignac number, because 2312254422505 - 21 = 2312254422503 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2312254422503) 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 in 15 ways as a sum of consecutive naturals, for example, 9330516 + ... + 9575125.
It is an arithmetic number, because the mean of its divisors is an integer number (176701582953).
Almost surely, 22312254422505 is an apocalyptic number.
It is an amenable number.
2312254422505 is a deficient number, since it is larger than the sum of its proper divisors (514970904743).
2312254422505 is a wasteful number, since it uses less digits than its factorization.
2312254422505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18906108.
The product of its (nonzero) digits is 192000, while the sum is 37.
Adding to 2312254422505 its reverse (5052244522132), we get a palindrome (7364498944637).
The spelling of 2312254422505 in words is "two trillion, three hundred twelve billion, two hundred fifty-four million, four hundred twenty-two thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •