Base | Representation |
---|---|
bin | 100111011010000111… |
… | …111100101011101001 |
3 | 11001012221200012201000 |
4 | 213122013330223221 |
5 | 1143124420103223 |
6 | 31234444345213 |
7 | 3025404645426 |
oct | 473207745351 |
9 | 131187605630 |
10 | 42314222313 |
11 | 16a44303570 |
12 | 824ab45209 |
13 | 3cb466708c |
14 | 2095a9cd4d |
15 | 1179c67543 |
hex | 9da1fcae9 |
42314222313 has 64 divisors (see below), whose sum is σ = 69570466560. Its totient is φ = 25203571200.
The previous prime is 42314222287. The next prime is 42314222339. The reversal of 42314222313 is 31322241324.
42314222313 is a `hidden beast` number, since 4 + 2 + 3 + 1 + 422 + 231 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (42314222287) and next prime (42314222339).
It is not a de Polignac number, because 42314222313 - 28 = 42314222057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (42314229313) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6349203 + ... + 6355863.
It is an arithmetic number, because the mean of its divisors is an integer number (1087038540).
Almost surely, 242314222313 is an apocalyptic number.
It is an amenable number.
42314222313 is a deficient number, since it is larger than the sum of its proper divisors (27256244247).
42314222313 is a wasteful number, since it uses less digits than its factorization.
42314222313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7047 (or 7041 counting only the distinct ones).
The product of its digits is 6912, while the sum is 27.
Adding to 42314222313 its reverse (31322241324), we get a palindrome (73636463637).
The spelling of 42314222313 in words is "forty-two billion, three hundred fourteen million, two hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •