Base | Representation |
---|---|
bin | 11110000100001000101… |
… | …11111111000010111100 |
3 | 10122202101110021011111121 |
4 | 33002010113333002330 |
5 | 113411102313443400 |
6 | 2110320514200324 |
7 | 134430011613061 |
oct | 17020427770274 |
9 | 3582343234447 |
10 | 1033013031100 |
11 | 369109a1a876 |
12 | 148255b830a4 |
13 | 7654995857b |
14 | 37dd8acac68 |
15 | 1bd0eb5a21a |
hex | f0845ff0bc |
1033013031100 has 72 divisors (see below), whose sum is σ = 2360968332800. Its totient is φ = 391233758400.
The previous prime is 1033013031073. The next prime is 1033013031101. The reversal of 1033013031100 is 11303103301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1033013031101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3187555 + ... + 3496645.
Almost surely, 21033013031100 is an apocalyptic number.
1033013031100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1033013031100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1180484166400).
1033013031100 is an abundant number, since it is smaller than the sum of its proper divisors (1327955301700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033013031100 is a wasteful number, since it uses less digits than its factorization.
1033013031100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310883 (or 310876 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 1033013031100 its reverse (11303103301), we get a palindrome (1044316134401).
The spelling of 1033013031100 in words is "one trillion, thirty-three billion, thirteen million, thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •