Base | Representation |
---|---|
bin | 1001000110101011011011… |
… | …1101010000001111101001 |
3 | 1022102222110000222212011112 |
4 | 2101222312331100033221 |
5 | 2303002140341412223 |
6 | 33142404354040105 |
7 | 2052136432132043 |
oct | 221526675201751 |
9 | 38388400885145 |
10 | 10010343310313 |
11 | 320a3a9914165 |
12 | 11580a3879035 |
13 | 577c81cc8c98 |
14 | 268708adaa93 |
15 | 1255d3017778 |
hex | 91ab6f503e9 |
10010343310313 has 8 divisors (see below), whose sum is σ = 10761399304320. Its totient is φ = 9281706898320.
The previous prime is 10010343310277. The next prime is 10010343310379. The reversal of 10010343310313 is 31301334301001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10010343310313 - 222 = 10010339116009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10010343310393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5604894578 + ... + 5604896363.
It is an arithmetic number, because the mean of its divisors is an integer number (1345174913040).
Almost surely, 210010343310313 is an apocalyptic number.
It is an amenable number.
10010343310313 is a deficient number, since it is larger than the sum of its proper divisors (751055994007).
10010343310313 is a wasteful number, since it uses less digits than its factorization.
10010343310313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11209791007.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 10010343310313 its reverse (31301334301001), we get a palindrome (41311677611314).
The spelling of 10010343310313 in words is "ten trillion, ten billion, three hundred forty-three million, three hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •