Base | Representation |
---|---|
bin | 1001001010001011000… |
… | …11111001000110110101 |
3 | 1010002021221220120221122 |
4 | 10211011203321012311 |
5 | 20124001102240321 |
6 | 400323201353325 |
7 | 31510356612251 |
oct | 4450543710665 |
9 | 1102257816848 |
10 | 314699649461 |
11 | 11151082552a |
12 | 50ba8338845 |
13 | 238a3386442 |
14 | 11335501261 |
15 | 82bce458ab |
hex | 49458f91b5 |
314699649461 has 8 divisors (see below), whose sum is σ = 315792048000. Its totient is φ = 313608189888.
The previous prime is 314699649301. The next prime is 314699649491. The reversal of 314699649461 is 164946996413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-314699649461 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 314699649394 and 314699649403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314699649491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 440090 + ... + 907236.
It is an arithmetic number, because the mean of its divisors is an integer number (39474006000).
Almost surely, 2314699649461 is an apocalyptic number.
It is an amenable number.
314699649461 is a deficient number, since it is larger than the sum of its proper divisors (1092398539).
314699649461 is a wasteful number, since it uses less digits than its factorization.
314699649461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469483.
The product of its digits is 30233088, while the sum is 62.
The spelling of 314699649461 in words is "three hundred fourteen billion, six hundred ninety-nine million, six hundred forty-nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •