Base | Representation |
---|---|
bin | 10010111101101000000… |
… | …000011000011011010000 |
3 | 11121120120200012221200220 |
4 | 102331220000120123100 |
5 | 132322242211134300 |
6 | 2434351200313040 |
7 | 163101346264164 |
oct | 22755000303320 |
9 | 4546520187626 |
10 | 1303120021200 |
11 | 462717309308 |
12 | 190678312780 |
13 | 95b6461242a |
14 | 470ddab4ca4 |
15 | 23d6ccc5da0 |
hex | 12f680186d0 |
1303120021200 has 120 divisors (see below), whose sum is σ = 4175353691808. Its totient is φ = 347413271040.
The previous prime is 1303120021163. The next prime is 1303120021213. The reversal of 1303120021200 is 21200213031.
It is a tau number, because it is divible by the number of its divisors (120).
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 1303120021200.
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, 4828227 + ... + 5090973.
Almost surely, 21303120021200 is an apocalyptic number.
1303120021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1303120021200 is an abundant number, since it is smaller than the sum of its proper divisors (2872233670608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1303120021200 is a wasteful number, since it uses less digits than its factorization.
1303120021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266901 (or 266890 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1303120021200 its reverse (21200213031), we get a palindrome (1324320234231).
The spelling of 1303120021200 in words is "one trillion, three hundred three billion, one hundred twenty million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •