Base | Representation |
---|---|
bin | 1000011100011000… |
… | …0111000101001111 |
3 | 12211221212110012120 |
4 | 2013012013011033 |
5 | 14120212313111 |
6 | 1012523304023 |
7 | 110111103420 |
oct | 20706070517 |
9 | 5757773176 |
10 | 2266526031 |
11 | a63438610 |
12 | 53307b013 |
13 | 2a1754b83 |
14 | 177037647 |
15 | d3ead406 |
hex | 8718714f |
2266526031 has 16 divisors (see below), whose sum is σ = 3767731968. Its totient is φ = 1177416000.
The previous prime is 2266526011. The next prime is 2266526063. The reversal of 2266526031 is 1306256622.
It is not a de Polignac number, because 2266526031 - 217 = 2266394959 is a prime.
It is a super-2 number, since 2×22665260312 = 10274280498401225922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 2266525983 and 2266526001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2266526011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4905670 + ... + 4906131.
It is an arithmetic number, because the mean of its divisors is an integer number (235483248).
Almost surely, 22266526031 is an apocalyptic number.
2266526031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2266526031 is a deficient number, since it is larger than the sum of its proper divisors (1501205937).
2266526031 is a wasteful number, since it uses less digits than its factorization.
2266526031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9811822.
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 2266526031 is about 47608.0458641184. The cubic root of 2266526031 is about 1313.5710561473.
The spelling of 2266526031 in words is "two billion, two hundred sixty-six million, five hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •