Base | Representation |
---|---|
bin | 11101101011111011111… |
… | …11101101001010010000 |
3 | 10121111212000122202010201 |
4 | 32311331333231022100 |
5 | 113203000400214300 |
6 | 2100331412104544 |
7 | 133460034206323 |
oct | 16657577551220 |
9 | 3544760582121 |
10 | 1020021101200 |
11 | 363652357622 |
12 | 14582b005154 |
13 | 75259150b9a |
14 | 375254627ba |
15 | 1b7ee29e66a |
hex | ed7dfed290 |
1020021101200 has 30 divisors (see below), whose sum is σ = 2450600696594. Its totient is φ = 408008440320.
The previous prime is 1020021101189. The next prime is 1020021101243. The reversal of 1020021101200 is 21011200201.
It can be written as a sum of positive squares in 3 ways, for example, as 14188621456 + 1005832479744 = 119116^2 + 1002912^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1275025977 + ... + 1275026776.
Almost surely, 21020021101200 is an apocalyptic number.
1020021101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020021101200 is an abundant number, since it is smaller than the sum of its proper divisors (1430579595394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020021101200 is a wasteful number, since it uses less digits than its factorization.
1020021101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2550052771 (or 2550052760 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1020021101200 its reverse (21011200201), we get a palindrome (1041032301401).
Subtracting from 1020021101200 its reverse (21011200201), we obtain a palindrome (999009900999).
The spelling of 1020021101200 in words is "one trillion, twenty billion, twenty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •