Base | Representation |
---|---|
bin | 11110000100100010011… |
… | …01010011000010101110 |
3 | 10122202221110101122111120 |
4 | 33002101031103002232 |
5 | 113412022423130410 |
6 | 2110354125001410 |
7 | 134435234632062 |
oct | 17022115230256 |
9 | 3582843348446 |
10 | 1033228333230 |
11 | 36920a504515 |
12 | 1482b60b3266 |
13 | 7658243c892 |
14 | 38019533aa2 |
15 | 1bd239d8570 |
hex | f0913530ae |
1033228333230 has 128 divisors (see below), whose sum is σ = 2603699804160. Its totient is φ = 261906670080.
The previous prime is 1033228333147. The next prime is 1033228333261. The reversal of 1033228333230 is 323338223301.
It is a junction number, because it is equal to n+sod(n) for n = 1033228333191 and 1033228333200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 298360479 + ... + 298363941.
It is an arithmetic number, because the mean of its divisors is an integer number (20341404720).
Almost surely, 21033228333230 is an apocalyptic number.
1033228333230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1033228333230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1301849902080).
1033228333230 is an abundant number, since it is smaller than the sum of its proper divisors (1570471470930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033228333230 is a wasteful number, since it uses less digits than its factorization.
1033228333230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6066.
The product of its (nonzero) digits is 46656, while the sum is 33.
The spelling of 1033228333230 in words is "one trillion, thirty-three billion, two hundred twenty-eight million, three hundred thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •