Base | Representation |
---|---|
bin | 101100001000111010101… |
… | …010011011011110100100 |
3 | 101201222022002110200100202 |
4 | 230020322222123132210 |
5 | 344144024131041400 |
6 | 10241240325330032 |
7 | 432100203022610 |
oct | 54107252333644 |
9 | 11658262420322 |
10 | 3033231112100 |
11 | a6a427983092 |
12 | 40ba3ab66918 |
13 | 190056437a47 |
14 | a6b48508340 |
15 | 53d7bd644d5 |
hex | 2c23aa9b7a4 |
3033231112100 has 72 divisors (see below), whose sum is σ = 7664345575488. Its totient is φ = 1020342960000.
The previous prime is 3033231112063. The next prime is 3033231112151. The reversal of 3033231112100 is 12111323303.
3033231112100 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×30332311121002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40842026 + ... + 40916225.
It is an arithmetic number, because the mean of its divisors is an integer number (106449244104).
Almost surely, 23033231112100 is an apocalyptic number.
It is an amenable number.
3033231112100 is an abundant number, since it is smaller than the sum of its proper divisors (4631114463388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3033231112100 is a wasteful number, since it uses less digits than its factorization.
3033231112100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81758325 (or 81758318 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3033231112100 its reverse (12111323303), we get a palindrome (3045342435403).
The spelling of 3033231112100 in words is "three trillion, thirty-three billion, two hundred thirty-one million, one hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •