Base | Representation |
---|---|
bin | 10001010011000101… |
… | …10010011101110011 |
3 | 212222012222102022220 |
4 | 20221202302131303 |
5 | 123004422420201 |
6 | 4133310532123 |
7 | 446065342443 |
oct | 105142623563 |
9 | 25865872286 |
10 | 9286920051 |
11 | 3a36251542 |
12 | 1972207043 |
13 | b5004b686 |
14 | 641582123 |
15 | 3954a5036 |
hex | 2298b2773 |
9286920051 has 8 divisors (see below), whose sum is σ = 12585553104. Its totient is φ = 6089783520.
The previous prime is 9286920007. The next prime is 9286920079. The reversal of 9286920051 is 1500296829.
9286920051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 9286920051 - 225 = 9253365619 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 9286919985 and 9286920012.
It is not an unprimeable number, because it can be changed into a prime (9286920001) 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, 25373916 + ... + 25374281.
It is an arithmetic number, because the mean of its divisors is an integer number (1573194138).
Almost surely, 29286920051 is an apocalyptic number.
9286920051 is a deficient number, since it is larger than the sum of its proper divisors (3298633053).
9286920051 is a wasteful number, since it uses less digits than its factorization.
9286920051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50748261.
The product of its (nonzero) digits is 77760, while the sum is 42.
The square root of 9286920051 is about 96368.6673717137. The cubic root of 9286920051 is about 2101.9573625481.
The spelling of 9286920051 in words is "nine billion, two hundred eighty-six million, nine hundred twenty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •