Base | Representation |
---|---|
bin | 101011110011011111010… |
… | …001100100001111000000 |
3 | 101122202220121201001220111 |
4 | 223303133101210033000 |
5 | 343304414043444412 |
6 | 10222513302321104 |
7 | 430324063405624 |
oct | 53633721441700 |
9 | 11582817631814 |
10 | 3010223031232 |
11 | a606a047441a |
12 | 407499729194 |
13 | 18ab2a7a9701 |
14 | a59a4915184 |
15 | 53481eaa2a7 |
hex | 2bcdf4643c0 |
3010223031232 has 28 divisors (see below), whose sum is σ = 6040528320240. Its totient is φ = 1488200147456.
The previous prime is 3010223031229. The next prime is 3010223031247. The reversal of 3010223031232 is 2321303220103.
3010223031232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×30102230312322 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 264234388 + ... + 264245779.
Almost surely, 23010223031232 is an apocalyptic number.
3010223031232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3010223031232 is an abundant number, since it is smaller than the sum of its proper divisors (3030305289008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3010223031232 is an equidigital number, since it uses as much as digits as its factorization.
3010223031232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528480268 (or 528480258 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 3010223031232 its reverse (2321303220103), we get a palindrome (5331526251335).
The spelling of 3010223031232 in words is "three trillion, ten billion, two hundred twenty-three million, thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •