Base | Representation |
---|---|
bin | 100001101010011101110… |
… | …100100101010000001000 |
3 | 22012011010122201212121201 |
4 | 201222131310211100020 |
5 | 300400210043242412 |
6 | 4530422301113544 |
7 | 326063504235430 |
oct | 41523564452010 |
9 | 8164118655551 |
10 | 2313340212232 |
11 | 81209a271a75 |
12 | 314410b588b4 |
13 | 13a1bb0a1a8a |
14 | 7dd755db2c0 |
15 | 402968e1e57 |
hex | 21a9dd25408 |
2313340212232 has 32 divisors (see below), whose sum is σ = 4957481692800. Its totient is φ = 991366700544.
The previous prime is 2313340212229. The next prime is 2313340212311. The reversal of 2313340212232 is 2322120433132.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 2313340212232.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 481257 + ... + 2204152.
It is an arithmetic number, because the mean of its divisors is an integer number (154921302900).
Almost surely, 22313340212232 is an apocalyptic number.
It is an amenable number.
2313340212232 is an abundant number, since it is smaller than the sum of its proper divisors (2644141480568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2313340212232 is a wasteful number, since it uses less digits than its factorization.
2313340212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2700805 (or 2700801 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 2313340212232 its reverse (2322120433132), we get a palindrome (4635460645364).
The spelling of 2313340212232 in words is "two trillion, three hundred thirteen billion, three hundred forty million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •