Base | Representation |
---|---|
bin | 101101010000101100010… |
… | …100111010011110011000 |
3 | 102000100020011011221110210 |
4 | 231100230110322132120 |
5 | 401424343300032300 |
6 | 10340504015211120 |
7 | 440466063543366 |
oct | 55205424723630 |
9 | 12010204157423 |
10 | 3110300002200 |
11 | a9a0862a1996 |
12 | 422969216aa0 |
13 | 1973b92288b1 |
14 | aa779c90636 |
15 | 55d8cd4b050 |
hex | 2d42c53a798 |
3110300002200 has 96 divisors (see below), whose sum is σ = 9735541171200. Its totient is φ = 821360760960.
The previous prime is 3110300002189. The next prime is 3110300002267. The reversal of 3110300002200 is 22000030113.
It is a happy number.
It is a super-2 number, since 2×31103000022002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
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, 25102440 + ... + 25226039.
It is an arithmetic number, because the mean of its divisors is an integer number (101411887200).
Almost surely, 23110300002200 is an apocalyptic number.
3110300002200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3110300002200 is an abundant number, since it is smaller than the sum of its proper divisors (6625241169000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3110300002200 is a wasteful number, since it uses less digits than its factorization.
3110300002200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50328601 (or 50328592 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 3110300002200 its reverse (22000030113), we get a palindrome (3132300032313).
The spelling of 3110300002200 in words is "three trillion, one hundred ten billion, three hundred million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •