Base | Representation |
---|---|
bin | 10011000100010100101… |
… | …111100000001010001101 |
3 | 11122021010222010020221101 |
4 | 103010110233200022031 |
5 | 132432010113201333 |
6 | 2441541031303101 |
7 | 163444530630235 |
oct | 23042457401215 |
9 | 4567128106841 |
10 | 1310313022093 |
11 | 4657785a5349 |
12 | 191b4521aa91 |
13 | 9673c8c198a |
14 | 475c3110cc5 |
15 | 2413e51567d |
hex | 13114be028d |
1310313022093 has 8 divisors (see below), whose sum is σ = 1364550932736. Its totient is φ = 1256823220800.
The previous prime is 1310313022079. The next prime is 1310313022097. The reversal of 1310313022093 is 3902203130131.
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 1310313022093 - 25 = 1310313022061 is a prime.
It is a super-2 number, since 2×13103130220932 (a number of 25 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 (1310313022097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187023763 + ... + 187030768.
It is an arithmetic number, because the mean of its divisors is an integer number (170568866592).
Almost surely, 21310313022093 is an apocalyptic number.
It is an amenable number.
1310313022093 is a deficient number, since it is larger than the sum of its proper divisors (54237910643).
1310313022093 is a wasteful number, since it uses less digits than its factorization.
1310313022093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374054675.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 1310313022093 in words is "one trillion, three hundred ten billion, three hundred thirteen million, twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •