Base | Representation |
---|---|
bin | 1000010011110011… |
… | …1101000000010100 |
3 | 12202110012202012210 |
4 | 2010330331000110 |
5 | 14032011233103 |
6 | 1005200513420 |
7 | 106163353350 |
oct | 20474750024 |
9 | 5673182183 |
10 | 2230571028 |
11 | a45110034 |
12 | 52301b870 |
13 | 29717651a |
14 | 172358460 |
15 | d0c59e03 |
hex | 84f3d014 |
2230571028 has 24 divisors (see below), whose sum is σ = 5948189632. Its totient is φ = 637305984.
The previous prime is 2230571023. The next prime is 2230571039. The reversal of 2230571028 is 8201750322.
It is a super-2 number, since 2×22305710282 = 9950894221905953568, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2230570986 and 2230571004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2230571023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13277125 + ... + 13277292.
Almost surely, 22230571028 is an apocalyptic number.
2230571028 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
2230571028 is an abundant number, since it is smaller than the sum of its proper divisors (3717618604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2230571028 is a wasteful number, since it uses less digits than its factorization.
2230571028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26554431 (or 26554429 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 2230571028 is about 47228.9215206107. The cubic root of 2230571028 is about 1306.5880615575.
The spelling of 2230571028 in words is "two billion, two hundred thirty million, five hundred seventy-one thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •