Base | Representation |
---|---|
bin | 1000110000000000… |
… | …00111010111010101 |
3 | 110010101110101012221 |
4 | 10120000013113111 |
5 | 34110044310040 |
6 | 2054050542341 |
7 | 224261241322 |
oct | 43000072725 |
9 | 13111411187 |
10 | 4697650645 |
11 | 1aa0779506 |
12 | ab12979b1 |
13 | 59b31a64c |
14 | 327c79b49 |
15 | 1c763174a |
hex | 1180075d5 |
4697650645 has 12 divisors (see below), whose sum is σ = 5775879564. Its totient is φ = 3665693120.
The previous prime is 4697650583. The next prime is 4697650669. The reversal of 4697650645 is 5460567964.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 824953284 + 3872697361 = 28722^2 + 62231^2 .
It is a de Polignac number, because none of the positive numbers 2k-4697650645 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4697650592 and 4697650601.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 978942 + ... + 983728.
It is an arithmetic number, because the mean of its divisors is an integer number (481323297).
Almost surely, 24697650645 is an apocalyptic number.
It is an amenable number.
4697650645 is a deficient number, since it is larger than the sum of its proper divisors (1078228919).
4697650645 is an frugal number, since it uses more digits than its factorization.
4697650645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9620 (or 4833 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 52.
The square root of 4697650645 is about 68539.4094299039. The cubic root of 4697650645 is about 1674.7895355967.
The spelling of 4697650645 in words is "four billion, six hundred ninety-seven million, six hundred fifty thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •