Base | Representation |
---|---|
bin | 1001000111100101100… |
… | …11011101010100011111 |
3 | 1002221201012100010012011 |
4 | 10203302303131110133 |
5 | 20113130133033043 |
6 | 355533322452051 |
7 | 31431100303033 |
oct | 4436263352437 |
9 | 1087635303164 |
10 | 313311221023 |
11 | 11096901a709 |
12 | 5087b364027 |
13 | 23711829958 |
14 | 11242d621c3 |
15 | 823b0d959d |
hex | 48f2cdd51f |
313311221023 has 4 divisors (see below), whose sum is σ = 326933448048. Its totient is φ = 299688994000.
The previous prime is 313311221009. The next prime is 313311221053. The reversal of 313311221023 is 320122113313.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320122113313 = 4483 ⋅71408011.
It is a cyclic number.
It is not a de Polignac number, because 313311221023 - 217 = 313311089951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313311220985 and 313311221003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313311221053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6811113478 + ... + 6811113523.
It is an arithmetic number, because the mean of its divisors is an integer number (81733362012).
Almost surely, 2313311221023 is an apocalyptic number.
313311221023 is a deficient number, since it is larger than the sum of its proper divisors (13622227025).
313311221023 is a wasteful number, since it uses less digits than its factorization.
313311221023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13622227024.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 313311221023 its reverse (320122113313), we get a palindrome (633433334336).
The spelling of 313311221023 in words is "three hundred thirteen billion, three hundred eleven million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •