Base | Representation |
---|---|
bin | 10010111100110001001… |
… | …010110010011010011000 |
3 | 11121111012120001010220010 |
4 | 102330301022302122120 |
5 | 132313401200032300 |
6 | 2434120013201520 |
7 | 163036505250066 |
oct | 22746112623230 |
9 | 4544176033803 |
10 | 1302200002200 |
11 | 462294a53429 |
12 | 1904601902a0 |
13 | 95a48b29aa6 |
14 | 47053827036 |
15 | 23d17142a50 |
hex | 12f312b2698 |
1302200002200 has 96 divisors (see below), whose sum is σ = 4212333964800. Its totient is φ = 332155359360.
The previous prime is 1302200002157. The next prime is 1302200002217. The reversal of 1302200002200 is 22000022031.
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 pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47167360 + ... + 47194959.
It is an arithmetic number, because the mean of its divisors is an integer number (43878478800).
Almost surely, 21302200002200 is an apocalyptic number.
1302200002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1302200002200 is an abundant number, since it is smaller than the sum of its proper divisors (2910133962600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302200002200 is a wasteful number, since it uses less digits than its factorization.
1302200002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94362361 (or 94362352 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 1302200002200 its reverse (22000022031), we get a palindrome (1324200024231).
The spelling of 1302200002200 in words is "one trillion, three hundred two billion, two hundred million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •