Base | Representation |
---|---|
bin | 1000110111001001… |
… | …11110100101111101 |
3 | 110021120100102221202 |
4 | 10123210332211331 |
5 | 34220424130233 |
6 | 2104032505245 |
7 | 225620215103 |
oct | 43344764575 |
9 | 13246312852 |
10 | 4757645693 |
11 | 2021626699 |
12 | b093ab225 |
13 | 5aa895288 |
14 | 331c15c73 |
15 | 1cca32be8 |
hex | 11b93e97d |
4757645693 has 2 divisors, whose sum is σ = 4757645694. Its totient is φ = 4757645692.
The previous prime is 4757645639. The next prime is 4757645701. The reversal of 4757645693 is 3965467574.
4757645693 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (4757645639) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4569489604 + 188156089 = 67598^2 + 13717^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4757645693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4757645623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2378822846 + 2378822847.
It is an arithmetic number, because the mean of its divisors is an integer number (2378822847).
Almost surely, 24757645693 is an apocalyptic number.
It is an amenable number.
4757645693 is a deficient number, since it is larger than the sum of its proper divisors (1).
4757645693 is an equidigital number, since it uses as much as digits as its factorization.
4757645693 is an evil number, because the sum of its binary digits is even.
The product of its digits is 19051200, while the sum is 56.
The square root of 4757645693 is about 68975.6891447994. The cubic root of 4757645693 is about 1681.8891368238.
The spelling of 4757645693 in words is "four billion, seven hundred fifty-seven million, six hundred forty-five thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •