Base | Representation |
---|---|
bin | 1000100111110001… |
… | …1110010001111001 |
3 | 12222021211012122111 |
4 | 2021330132101321 |
5 | 14214432100012 |
6 | 1021352052321 |
7 | 111231330310 |
oct | 21174362171 |
9 | 5867735574 |
10 | 2314331257 |
11 | a8841a367 |
12 | 5470940a1 |
13 | 2ab6222a4 |
14 | 17d51d277 |
15 | d82a2ba7 |
hex | 89f1e479 |
2314331257 has 16 divisors (see below), whose sum is σ = 2746662912. Its totient is φ = 1908196560.
The previous prime is 2314331207. The next prime is 2314331263. The reversal of 2314331257 is 7521334132.
It is a cyclic number.
It is not a de Polignac number, because 2314331257 - 215 = 2314298489 is a prime.
It is a super-2 number, since 2×23143312572 = 10712258334254400098, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (2314331207) 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 15 ways as a sum of consecutive naturals, for example, 4308 + ... + 68170.
It is an arithmetic number, because the mean of its divisors is an integer number (171666432).
Almost surely, 22314331257 is an apocalyptic number.
It is an amenable number.
2314331257 is a deficient number, since it is larger than the sum of its proper divisors (432331655).
2314331257 is a wasteful number, since it uses less digits than its factorization.
2314331257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64068.
The product of its digits is 15120, while the sum is 31.
The square root of 2314331257 is about 48107.4968897780. The cubic root of 2314331257 is about 1322.7420915367.
Adding to 2314331257 its reverse (7521334132), we get a palindrome (9835665389).
The spelling of 2314331257 in words is "two billion, three hundred fourteen million, three hundred thirty-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •