Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11000001111011110000 |
3 | 10121111210121211120010021 |
4 | 32311330303001323300 |
5 | 113202430224014300 |
6 | 2100325413213224 |
7 | 133456401312616 |
oct | 16657463017360 |
9 | 3544717746107 |
10 | 1020001001200 |
11 | 363641a79155 |
12 | 145824331214 |
13 | 75254c340ac |
14 | 3752290d6b6 |
15 | 1b7ec62dd1a |
hex | ed7ccc1ef0 |
1020001001200 has 60 divisors (see below), whose sum is σ = 2510322016608. Its totient is φ = 398049164800.
The previous prime is 1020001001141. The next prime is 1020001001213. The reversal of 1020001001200 is 21001000201.
It is a super-3 number, since 3×10200010012003 (a number of 37 digits) contains 333 as substring.
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 11 ways as a sum of consecutive naturals, for example, 31081192 + ... + 31113991.
Almost surely, 21020001001200 is an apocalyptic number.
1020001001200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020001001200 is an abundant number, since it is smaller than the sum of its proper divisors (1490321015408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020001001200 is a wasteful number, since it uses less digits than its factorization.
1020001001200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62195242 (or 62195231 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 1020001001200 its reverse (21001000201), we get a palindrome (1041002001401).
Subtracting from 1020001001200 its reverse (21001000201), we obtain a palindrome (999000000999).
The spelling of 1020001001200 in words is "one trillion, twenty billion, one million, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •