Base | Representation |
---|---|
bin | 1001011010000011110101… |
… | …1101100001111110111001 |
3 | 1100121210220020002012002001 |
4 | 2112200331131201332321 |
5 | 2323431100433302223 |
6 | 33555352505141001 |
7 | 2115164631530344 |
oct | 226407535417671 |
9 | 40553806065061 |
10 | 10343312400313 |
11 | 3328635222782 |
12 | 11b072a48a761 |
13 | 5a04a7370c69 |
14 | 27a89472545b |
15 | 12e0becda9ad |
hex | 9683d761fb9 |
10343312400313 has 8 divisors (see below), whose sum is σ = 10370721726720. Its totient is φ = 10315938193920.
The previous prime is 10343312400233. The next prime is 10343312400359. The reversal of 10343312400313 is 31300421334301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10343312400313 is a prime.
It is a super-2 number, since 2×103433124003132 (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 (10343312400613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8190145 + ... + 9368302.
It is an arithmetic number, because the mean of its divisors is an integer number (1296340215840).
Almost surely, 210343312400313 is an apocalyptic number.
It is an amenable number.
10343312400313 is a deficient number, since it is larger than the sum of its proper divisors (27409326407).
10343312400313 is an equidigital number, since it uses as much as digits as its factorization.
10343312400313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17560007.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 10343312400313 its reverse (31300421334301), we get a palindrome (41643733734614).
The spelling of 10343312400313 in words is "ten trillion, three hundred forty-three billion, three hundred twelve million, four hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •