Base | Representation |
---|---|
bin | 1000011100010101… |
… | …0001011100101111 |
3 | 12211221110021212021 |
4 | 2013011101130233 |
5 | 14120133300401 |
6 | 1012514451011 |
7 | 110106200101 |
oct | 20705213457 |
9 | 5757407767 |
10 | 2266306351 |
11 | a632a8561 |
12 | 532b93a67 |
13 | 2a16a8b9a |
14 | 176dbb571 |
15 | d3e682a1 |
hex | 8715172f |
2266306351 has 8 divisors (see below), whose sum is σ = 2351557040. Its totient is φ = 2182318848.
The previous prime is 2266306349. The next prime is 2266306369. The reversal of 2266306351 is 1536036622.
2266306351 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 a cyclic number.
It is not a de Polignac number, because 2266306351 - 21 = 2266306349 is a prime.
It is a super-2 number, since 2×22663063512 = 10272288953165870402, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2266306381) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 312141 + ... + 319318.
It is an arithmetic number, because the mean of its divisors is an integer number (293944630).
Almost surely, 22266306351 is an apocalyptic number.
2266306351 is a deficient number, since it is larger than the sum of its proper divisors (85250689).
2266306351 is an equidigital number, since it uses as much as digits as its factorization.
2266306351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 631593.
The product of its (nonzero) digits is 38880, while the sum is 34.
The square root of 2266306351 is about 47605.7386351688. The cubic root of 2266306351 is about 1313.5286160710.
The spelling of 2266306351 in words is "two billion, two hundred sixty-six million, three hundred six thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •