Base | Representation |
---|---|
bin | 1001000111001110000… |
… | …00000110110010100111 |
3 | 1002221012101202010011102 |
4 | 10203213000012302213 |
5 | 20112223440210043 |
6 | 355501530430315 |
7 | 31423144241345 |
oct | 4434700066247 |
9 | 1087171663142 |
10 | 313113210023 |
11 | 110877276059 |
12 | 50824b9239b |
13 | 236ac7baa93 |
14 | 1122493a995 |
15 | 8228a246b8 |
hex | 48e7006ca7 |
313113210023 has 8 divisors (see below), whose sum is σ = 336966580080. Its totient is φ = 289863722880.
The previous prime is 313113209987. The next prime is 313113210041. The reversal of 313113210023 is 320012311313.
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 313113210023 - 218 = 313112947879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313113209977 and 313113210004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313113210043) 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, 150969653 + ... + 150971726.
It is an arithmetic number, because the mean of its divisors is an integer number (42120822510).
Almost surely, 2313113210023 is an apocalyptic number.
313113210023 is a deficient number, since it is larger than the sum of its proper divisors (23853370057).
313113210023 is a wasteful number, since it uses less digits than its factorization.
313113210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301941457.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 313113210023 its reverse (320012311313), we get a palindrome (633125521336).
The spelling of 313113210023 in words is "three hundred thirteen billion, one hundred thirteen million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •