Base | Representation |
---|---|
bin | 1001011010000110110100… |
… | …0000001010001100011111 |
3 | 1100121212221210220210212002 |
4 | 2112201231000022030133 |
5 | 2323434214130211241 |
6 | 34000004000432515 |
7 | 2115223455215441 |
oct | 226415500121437 |
9 | 40555853823762 |
10 | 10344110007071 |
11 | 3328a04479515 |
12 | 11b091161873b |
13 | 5a05a3696719 |
14 | 27a92c62a491 |
15 | 12e119d3d89b |
hex | 9686d00a31f |
10344110007071 has 4 divisors (see below), whose sum is σ = 10344135925992. Its totient is φ = 10344084088152.
The previous prime is 10344110007067. The next prime is 10344110007169. The reversal of 10344110007071 is 17070001144301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10344110007071 - 22 = 10344110007067 is a prime.
It is a super-2 number, since 2×103441100070712 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10344110007031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12351305 + ... + 13162178.
It is an arithmetic number, because the mean of its divisors is an integer number (2586033981498).
Almost surely, 210344110007071 is an apocalyptic number.
10344110007071 is a deficient number, since it is larger than the sum of its proper divisors (25918921).
10344110007071 is an equidigital number, since it uses as much as digits as its factorization.
10344110007071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25918920.
The product of its (nonzero) digits is 2352, while the sum is 29.
The spelling of 10344110007071 in words is "ten trillion, three hundred forty-four billion, one hundred ten million, seven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •