Base | Representation |
---|---|
bin | 101101001001010000101… |
… | …100000000011101010000 |
3 | 101222120122000120222012220 |
4 | 231021100230000131100 |
5 | 401312022421214300 |
6 | 10333104114221040 |
7 | 440064245524035 |
oct | 55112054003520 |
9 | 11876560528186 |
10 | 3102320101200 |
11 | a96760902191 |
12 | 421300884780 |
13 | 196716c01c98 |
14 | aa22013938c |
15 | 55a724c0da0 |
hex | 2d250b00750 |
3102320101200 has 60 divisors (see below), whose sum is σ = 9937765394688. Its totient is φ = 827285360000.
The previous prime is 3102320101193. The next prime is 3102320101247. The reversal of 3102320101200 is 21010232013.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 3102320101200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1292632176 + ... + 1292634575.
Almost surely, 23102320101200 is an apocalyptic number.
3102320101200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3102320101200 is an abundant number, since it is smaller than the sum of its proper divisors (6835445293488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3102320101200 is a wasteful number, since it uses less digits than its factorization.
3102320101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2585266772 (or 2585266761 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 3102320101200 its reverse (21010232013), we get a palindrome (3123330333213).
The spelling of 3102320101200 in words is "three trillion, one hundred two billion, three hundred twenty million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •