Base | Representation |
---|---|
bin | 10010101011000… |
… | …100110110110001 |
3 | 210211111101001220 |
4 | 102223010312301 |
5 | 1120200010334 |
6 | 51030415253 |
7 | 10522565340 |
oct | 2253046661 |
9 | 724441056 |
10 | 313281969 |
11 | 150926420 |
12 | 88b01529 |
13 | 4cb9b460 |
14 | 2d86db57 |
15 | 1c784449 |
hex | 12ac4db1 |
313281969 has 32 divisors (see below), whose sum is σ = 560845824. Its totient is φ = 150223680.
The previous prime is 313281911. The next prime is 313281971. The reversal of 313281969 is 969182313.
It is not a de Polignac number, because 313281969 - 27 = 313281841 is a prime.
It is a super-2 number, since 2×3132819692 = 196291184201033922, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 313281969.
It is not an unprimeable number, because it can be changed into a prime (313281979) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49159 + ... + 55164.
It is an arithmetic number, because the mean of its divisors is an integer number (17526432).
Almost surely, 2313281969 is an apocalyptic number.
313281969 is a gapful number since it is divisible by the number (39) formed by its first and last digit.
It is an amenable number.
313281969 is a deficient number, since it is larger than the sum of its proper divisors (247563855).
313281969 is a wasteful number, since it uses less digits than its factorization.
313281969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104357.
The product of its digits is 69984, while the sum is 42.
The square root of 313281969 is about 17699.7731341393. The cubic root of 313281969 is about 679.1699567976.
It can be divided in two parts, 313 and 281969, that added together give a palindrome (282282).
The spelling of 313281969 in words is "three hundred thirteen million, two hundred eighty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •