Base | Representation |
---|---|
bin | 1001101111011100011001… |
… | …0110110100110001110001 |
3 | 1101220221010210112222220001 |
4 | 2123313012112310301301 |
5 | 2400440433410403131 |
6 | 34440230304350001 |
7 | 2153551445151643 |
oct | 233670626646161 |
9 | 41827123488801 |
10 | 10710681341041 |
11 | 345a4134322a0 |
12 | 124b975615301 |
13 | 5c90224bb0b6 |
14 | 290584c74893 |
15 | 138921ae2261 |
hex | 9bdc65b4c71 |
10710681341041 has 32 divisors (see below), whose sum is σ = 12230061834240. Its totient is φ = 9291615062400.
The previous prime is 10710681340981. The next prime is 10710681341053. The reversal of 10710681341041 is 14014318601701.
It is not a de Polignac number, because 10710681341041 - 29 = 10710681340529 is a prime.
It is a super-2 number, since 2×107106813410412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10710681341341) 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, 10657270 + ... + 11618896.
It is an arithmetic number, because the mean of its divisors is an integer number (382189432320).
Almost surely, 210710681341041 is an apocalyptic number.
10710681341041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10710681341041 is a deficient number, since it is larger than the sum of its proper divisors (1519380493199).
10710681341041 is a wasteful number, since it uses less digits than its factorization.
10710681341041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 962125.
The product of its (nonzero) digits is 16128, while the sum is 37.
Adding to 10710681341041 its reverse (14014318601701), we get a palindrome (24724999942742).
The spelling of 10710681341041 in words is "ten trillion, seven hundred ten billion, six hundred eighty-one million, three hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •