Base | Representation |
---|---|
bin | 1000101111001010… |
… | …11110111011000011 |
3 | 110002220022200112210 |
4 | 10113211132323003 |
5 | 34101302404001 |
6 | 2053241153203 |
7 | 224145013362 |
oct | 42745367303 |
9 | 13086280483 |
10 | 4690669251 |
11 | 1a97840264 |
12 | aaaa8b803 |
13 | 599a44a48 |
14 | 326d7d7d9 |
15 | 1c6c02dd6 |
hex | 11795eec3 |
4690669251 has 16 divisors (see below), whose sum is σ = 6585587840. Its totient is φ = 2961541440.
The previous prime is 4690669219. The next prime is 4690669259. The reversal of 4690669251 is 1529660964.
It is not a de Polignac number, because 4690669251 - 25 = 4690669219 is a prime.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4690669251.
It is not an unprimeable number, because it can be changed into a prime (4690669259) 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 15 ways as a sum of consecutive naturals, for example, 183696 + ... + 207666.
It is an arithmetic number, because the mean of its divisors is an integer number (411599240).
Almost surely, 24690669251 is an apocalyptic number.
4690669251 is a deficient number, since it is larger than the sum of its proper divisors (1894918589).
4690669251 is a wasteful number, since it uses less digits than its factorization.
4690669251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27426.
The product of its (nonzero) digits is 699840, while the sum is 48.
The square root of 4690669251 is about 68488.4607141962. The cubic root of 4690669251 is about 1673.9594637535.
The spelling of 4690669251 in words is "four billion, six hundred ninety million, six hundred sixty-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •