Base | Representation |
---|---|
bin | 1001000111100101011… |
… | …11001011111101001011 |
3 | 1002221201010020020020210 |
4 | 10203302233023331023 |
5 | 20113124341220243 |
6 | 355533242452203 |
7 | 31431054630432 |
oct | 4436257137513 |
9 | 1087633206223 |
10 | 313310101323 |
11 | 11096842543a |
12 | 5087ab04063 |
13 | 237115270cb |
14 | 11242b50119 |
15 | 823ae67933 |
hex | 48f2bcbf4b |
313310101323 has 32 divisors (see below), whose sum is σ = 425264797440. Its totient is φ = 205134336000.
The previous prime is 313310101319. The next prime is 313310101331. The reversal of 313310101323 is 323101013313.
It is not a de Polignac number, because 313310101323 - 22 = 313310101319 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313310101323.
It is not an unprimeable number, because it can be changed into a prime (313310101333) 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 31 ways as a sum of consecutive naturals, for example, 139185948 + ... + 139188198.
It is an arithmetic number, because the mean of its divisors is an integer number (13289524920).
Almost surely, 2313310101323 is an apocalyptic number.
313310101323 is a deficient number, since it is larger than the sum of its proper divisors (111954696117).
313310101323 is a wasteful number, since it uses less digits than its factorization.
313310101323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4107.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 313310101323 its reverse (323101013313), we get a palindrome (636411114636).
The spelling of 313310101323 in words is "three hundred thirteen billion, three hundred ten million, one hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •