Base | Representation |
---|---|
bin | 1001011001111100001000… |
… | …0100100000100010101011 |
3 | 1100121121112221201022102222 |
4 | 2112133002010200202223 |
5 | 2323412331003240433 |
6 | 33554411234344255 |
7 | 2115062423506112 |
oct | 226370204404253 |
9 | 40547487638388 |
10 | 10341242243243 |
11 | 332777271806a |
12 | 11b025112b08b |
13 | 5a0237501752 |
14 | 27a739806c79 |
15 | 12deed1bab98 |
hex | 967c21208ab |
10341242243243 has 4 divisors (see below), whose sum is σ = 10342439016408. Its totient is φ = 10340045470080.
The previous prime is 10341242243239. The next prime is 10341242243261. The reversal of 10341242243243 is 34234224214301.
It is a happy number.
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 10341242243243 - 22 = 10341242243239 is a prime.
It is a super-2 number, since 2×103412422432432 (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 (10341242243543) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 598373621 + ... + 598390902.
It is an arithmetic number, because the mean of its divisors is an integer number (2585609754102).
Almost surely, 210341242243243 is an apocalyptic number.
10341242243243 is a deficient number, since it is larger than the sum of its proper divisors (1196773165).
10341242243243 is an equidigital number, since it uses as much as digits as its factorization.
10341242243243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1196773164.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 10341242243243 its reverse (34234224214301), we get a palindrome (44575466457544).
The spelling of 10341242243243 in words is "ten trillion, three hundred forty-one billion, two hundred forty-two million, two hundred forty-three thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •