Base | Representation |
---|---|
bin | 1001001000101110… |
… | …10111000111011001 |
3 | 110122211202102112201 |
4 | 10210113113013121 |
5 | 40021144233230 |
6 | 2130420410201 |
7 | 232360262506 |
oct | 44427270731 |
9 | 13584672481 |
10 | 4905071065 |
11 | 209786a544 |
12 | b4a846961 |
13 | 6022a231b |
14 | 3476304ad |
15 | 1da9545ca |
hex | 1245d71d9 |
4905071065 has 8 divisors (see below), whose sum is σ = 6195879360. Its totient is φ = 3717527472.
The previous prime is 4905071063. The next prime is 4905071077. The reversal of 4905071065 is 5601705094.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4905071065 - 21 = 4905071063 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4905071063) 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 7 ways as a sum of consecutive naturals, for example, 25816069 + ... + 25816258.
It is an arithmetic number, because the mean of its divisors is an integer number (774484920).
Almost surely, 24905071065 is an apocalyptic number.
It is an amenable number.
4905071065 is a deficient number, since it is larger than the sum of its proper divisors (1290808295).
4905071065 is a wasteful number, since it uses less digits than its factorization.
4905071065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51632351.
The product of its (nonzero) digits is 37800, while the sum is 37.
The square root of 4905071065 is about 70036.2125260925. The cubic root of 4905071065 is about 1699.0849822091.
The spelling of 4905071065 in words is "four billion, nine hundred five million, seventy-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •