Base | Representation |
---|---|
bin | 101101100011010100011… |
… | …011101100011101110100 |
3 | 102002020212000010100021100 |
4 | 231203110123230131310 |
5 | 402241323324040200 |
6 | 10354012353250100 |
7 | 442104520602150 |
oct | 55432433543564 |
9 | 12066760110240 |
10 | 3130300221300 |
11 | aa760996058a |
12 | 42680b263930 |
13 | 19925597c175 |
14 | ab7161d2060 |
15 | 5665db0bd00 |
hex | 2d8d46ec774 |
3130300221300 has 108 divisors (see below), whose sum is σ = 11213431037536. Its totient is φ = 715497192000.
The previous prime is 3130300221299. The next prime is 3130300221317. The reversal of 3130300221300 is 31220030313.
3130300221300 is a `hidden beast` number, since 31 + 30 + 300 + 2 + 2 + 1 + 300 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 248430226 + ... + 248442825.
Almost surely, 23130300221300 is an apocalyptic number.
3130300221300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3130300221300 is an abundant number, since it is smaller than the sum of its proper divisors (8083130816236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3130300221300 is a wasteful number, since it uses less digits than its factorization.
3130300221300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496873078 (or 496873068 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 3130300221300 its reverse (31220030313), we get a palindrome (3161520251613).
The spelling of 3130300221300 in words is "three trillion, one hundred thirty billion, three hundred million, two hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •