Base | Representation |
---|---|
bin | 1001000111110011111… |
… | …00111001000001101001 |
3 | 1002222000112222100022010 |
4 | 10203321330321001221 |
5 | 20113401332244223 |
6 | 355553244550133 |
7 | 31434054453333 |
oct | 4437174710151 |
9 | 1088015870263 |
10 | 313431134313 |
11 | 110a1a782300 |
12 | 508b3552349 |
13 | 2373062326b |
14 | 11254c58453 |
15 | 82468c4393 |
hex | 48f9f39069 |
313431134313 has 48 divisors (see below), whose sum is σ = 467837395200. Its totient is φ = 186459583200.
The previous prime is 313431134293. The next prime is 313431134323.
313431134313 is nontrivially palindromic in base 10.
313431134313 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 313431134313 - 216 = 313431068777 is a prime.
It is not an unprimeable number, because it can be changed into a prime (313431134323) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14788558 + ... + 14809736.
It is an arithmetic number, because the mean of its divisors is an integer number (9746612400).
Almost surely, 2313431134313 is an apocalyptic number.
313431134313 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
313431134313 is a deficient number, since it is larger than the sum of its proper divisors (154406260887).
313431134313 is a wasteful number, since it uses less digits than its factorization.
313431134313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21954 (or 21943 counting only the distinct ones).
The product of its digits is 11664, while the sum is 30.
It can be divided in two parts, 313431 and 134313, that added together give a palindrome (447744).
The spelling of 313431134313 in words is "three hundred thirteen billion, four hundred thirty-one million, one hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •