Base | Representation |
---|---|
bin | 111100011000101… |
… | …1001011110100011 |
3 | 12020012200101220021 |
4 | 1320301121132203 |
5 | 13122202342311 |
6 | 533020454311 |
7 | 101132355220 |
oct | 17061313643 |
9 | 5205611807 |
10 | 2026215331 |
11 | 94a822628 |
12 | 4866aa397 |
13 | 263a257aa |
14 | 153160947 |
15 | bcd40171 |
hex | 78c597a3 |
2026215331 has 8 divisors (see below), whose sum is σ = 2324285280. Its totient is φ = 1730298048.
The previous prime is 2026215319. The next prime is 2026215361. The reversal of 2026215331 is 1335126202.
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 2026215331 - 221 = 2024118179 is a prime.
It is a super-2 number, since 2×20262153312 = 8211097135158879122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2026215296 and 2026215305.
It is not an unprimeable number, because it can be changed into a prime (2026215311) 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, 536146 + ... + 539911.
It is an arithmetic number, because the mean of its divisors is an integer number (290535660).
Almost surely, 22026215331 is an apocalyptic number.
2026215331 is a deficient number, since it is larger than the sum of its proper divisors (298069949).
2026215331 is a wasteful number, since it uses less digits than its factorization.
2026215331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076333.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 2026215331 is about 45013.5016522821. The cubic root of 2026215331 is about 1265.4020460680.
The spelling of 2026215331 in words is "two billion, twenty-six million, two hundred fifteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •