Base | Representation |
---|---|
bin | 111011101011010110101… |
… | …110011111000001101001 |
3 | 112112001101211110212201000 |
4 | 323223112232133001221 |
5 | 1014142322313412223 |
6 | 12415550214345213 |
7 | 602200430660505 |
oct | 73532656370151 |
9 | 15461354425630 |
10 | 4101001310313 |
11 | 1341252365a56 |
12 | 56297505b209 |
13 | 239951bb388b |
14 | 1026bd36d305 |
15 | 71a23084543 |
hex | 3bad6b9f069 |
4101001310313 has 24 divisors (see below), whose sum is σ = 6412153495200. Its totient is φ = 2590106084568.
The previous prime is 4101001310309. The next prime is 4101001310317. The reversal of 4101001310313 is 3130131001014.
4101001310313 is a `hidden beast` number, since 41 + 0 + 1 + 0 + 0 + 1 + 310 + 313 = 666.
It is an interprime number because it is at equal distance from previous prime (4101001310309) and next prime (4101001310317).
It is not a de Polignac number, because 4101001310313 - 22 = 4101001310309 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4101001310317) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 210362743 + ... + 210382236.
It is an arithmetic number, because the mean of its divisors is an integer number (267173062300).
Almost surely, 24101001310313 is an apocalyptic number.
It is an amenable number.
4101001310313 is a deficient number, since it is larger than the sum of its proper divisors (2311152184887).
4101001310313 is a wasteful number, since it uses less digits than its factorization.
4101001310313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420745026 (or 420745001 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 4101001310313 its reverse (3130131001014), we get a palindrome (7231132311327).
The spelling of 4101001310313 in words is "four trillion, one hundred one billion, one million, three hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.874 sec. • engine limits •