Base | Representation |
---|---|
bin | 100001101001100100100… |
… | …110101010010010100110 |
3 | 22012001122202102022211110 |
4 | 201221210212222102212 |
5 | 300341223321332132 |
6 | 4530143130045450 |
7 | 326030636626401 |
oct | 41514446522246 |
9 | 8161582368743 |
10 | 2312380261542 |
11 | 81174741289a |
12 | 3141a3579886 |
13 | 13a097247a10 |
14 | 7dcc3d16d38 |
15 | 4023c4c21cc |
hex | 21a649aa4a6 |
2312380261542 has 128 divisors (see below), whose sum is σ = 5457482956800. Its totient is φ = 646301730816.
The previous prime is 2312380261511. The next prime is 2312380261561. The reversal of 2312380261542 is 2451620832132.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 2312380261542.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 110698623 + ... + 110719509.
It is an arithmetic number, because the mean of its divisors is an integer number (42636585600).
Almost surely, 22312380261542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2312380261542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2728741478400).
2312380261542 is an abundant number, since it is smaller than the sum of its proper divisors (3145102695258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2312380261542 is a wasteful number, since it uses less digits than its factorization.
2312380261542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23830.
The product of its (nonzero) digits is 138240, while the sum is 39.
The spelling of 2312380261542 in words is "two trillion, three hundred twelve billion, three hundred eighty million, two hundred sixty-one thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •