Base | Representation |
---|---|
bin | 100110011100110111110… |
… | …000010111010001000011 |
3 | 100100121100020110121122212 |
4 | 212130313300113101003 |
5 | 321243003104442011 |
6 | 5341512511052335 |
7 | 361621441033232 |
oct | 46346760272103 |
9 | 10317306417585 |
10 | 2642340312131 |
11 | 929679247583 |
12 | 36812a5110ab |
13 | 162230091bc0 |
14 | 91c66064b19 |
15 | 48b0001808b |
hex | 26737c17443 |
2642340312131 has 32 divisors (see below), whose sum is σ = 2991764256768. Its totient is φ = 2315409465600.
The previous prime is 2642340312103. The next prime is 2642340312151. The reversal of 2642340312131 is 1312130432462.
2642340312131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2642340312131 - 26 = 2642340312067 is a prime.
It is a super-2 number, since 2×26423403121312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2642340312151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 251958170 + ... + 251968656.
It is an arithmetic number, because the mean of its divisors is an integer number (93492633024).
Almost surely, 22642340312131 is an apocalyptic number.
2642340312131 is a deficient number, since it is larger than the sum of its proper divisors (349423944637).
2642340312131 is a wasteful number, since it uses less digits than its factorization.
2642340312131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16811.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 2642340312131 its reverse (1312130432462), we get a palindrome (3954470744593).
The spelling of 2642340312131 in words is "two trillion, six hundred forty-two billion, three hundred forty million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •