Base | Representation |
---|---|
bin | 100001101100011100001… |
… | …101011001000100001100 |
3 | 22012100121102201000201120 |
4 | 201230130031121010030 |
5 | 300414030411121012 |
6 | 4531412525240540 |
7 | 326200162513515 |
oct | 41543415310414 |
9 | 8170542630646 |
10 | 2315460645132 |
11 | 812a88196658 |
12 | 314903103150 |
13 | 13a4684950bb |
14 | 800d7085a0c |
15 | 4036cb4358c |
hex | 21b1c35910c |
2315460645132 has 96 divisors (see below), whose sum is σ = 5558456870400. Its totient is φ = 749649572352.
The previous prime is 2315460645131. The next prime is 2315460645191.
2315460645132 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×23154606451322 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2315460645131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1135585369 + ... + 1135587407.
It is an arithmetic number, because the mean of its divisors is an integer number (57900592400).
Almost surely, 22315460645132 is an apocalyptic number.
It is an amenable number.
2315460645132 is an abundant number, since it is smaller than the sum of its proper divisors (3242996225268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2315460645132 is a wasteful number, since it uses less digits than its factorization.
2315460645132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5295 (or 5293 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 2315460645132 in words is "two trillion, three hundred fifteen billion, four hundred sixty million, six hundred forty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •