Base | Representation |
---|---|
bin | 101001101111011110000… |
… | …001100011110100011001 |
3 | 101011020000110212100011120 |
4 | 221233132001203310121 |
5 | 333444110320342431 |
6 | 10033431151115453 |
7 | 414145212604410 |
oct | 51573601436431 |
9 | 11136013770146 |
10 | 2868468137241 |
11 | a06568534473 |
12 | 3a3b18212b89 |
13 | 17a65948b305 |
14 | 9cb981d2477 |
15 | 4e937190196 |
hex | 29bde063d19 |
2868468137241 has 64 divisors (see below), whose sum is σ = 4619255746560. Its totient is φ = 1547972363520.
The previous prime is 2868468137231. The next prime is 2868468137251. The reversal of 2868468137241 is 1427318648682.
It is an interprime number because it is at equal distance from previous prime (2868468137231) and next prime (2868468137251).
It is not a de Polignac number, because 2868468137241 - 26 = 2868468137177 is a prime.
It is a super-2 number, since 2×28684681372412 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2868468137201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12033771 + ... + 12269823.
It is an arithmetic number, because the mean of its divisors is an integer number (72175871040).
Almost surely, 22868468137241 is an apocalyptic number.
2868468137241 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2868468137241 is a deficient number, since it is larger than the sum of its proper divisors (1750787609319).
2868468137241 is a wasteful number, since it uses less digits than its factorization.
2868468137241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236406.
The product of its digits is 24772608, while the sum is 60.
The spelling of 2868468137241 in words is "two trillion, eight hundred sixty-eight billion, four hundred sixty-eight million, one hundred thirty-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •