Base | Representation |
---|---|
bin | 1001000111000000101… |
… | …00100011110100100101 |
3 | 1002220220120211221001122 |
4 | 10203200110203310211 |
5 | 20112011242200201 |
6 | 355442444303325 |
7 | 31420313501255 |
oct | 4434024436445 |
9 | 1086816757048 |
10 | 313001131301 |
11 | 110819a84711 |
12 | 507b3541b45 |
13 | 23692508501 |
14 | 11213ac3965 |
15 | 821dc85e1b |
hex | 48e0523d25 |
313001131301 has 8 divisors (see below), whose sum is σ = 331468205184. Its totient is φ = 294540195520.
The previous prime is 313001131283. The next prime is 313001131381. The reversal of 313001131301 is 103131100313.
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 313001131301 - 214 = 313001114917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 313001131301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313001131381) 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, 1429325 + ... + 1633698.
It is an arithmetic number, because the mean of its divisors is an integer number (41433525648).
Almost surely, 2313001131301 is an apocalyptic number.
It is an amenable number.
313001131301 is a deficient number, since it is larger than the sum of its proper divisors (18467073883).
313001131301 is a wasteful number, since it uses less digits than its factorization.
313001131301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3069051.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 313001131301 its reverse (103131100313), we get a palindrome (416132231614).
The spelling of 313001131301 in words is "three hundred thirteen billion, one million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •