Base | Representation |
---|---|
bin | 1001010010111111111101… |
… | …0101011100110010011000 |
3 | 1100012012210112010002221210 |
4 | 2110233333111130302120 |
5 | 2314434134304311300 |
6 | 33423532123303120 |
7 | 2103341650654563 |
oct | 224577725346230 |
9 | 40165715102853 |
10 | 10222011010200 |
11 | 3291148800a40 |
12 | 119111697aaa0 |
13 | 591c15682c92 |
14 | 274a686194da |
15 | 12ad7096d050 |
hex | 94bff55cc98 |
10222011010200 has 96 divisors (see below), whose sum is σ = 34568982711360. Its totient is φ = 2478063273600.
The previous prime is 10222011010097. The next prime is 10222011010201. The reversal of 10222011010200 is 201011022201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222011010201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 774388174 + ... + 774401373.
It is an arithmetic number, because the mean of its divisors is an integer number (360093569910).
Almost surely, 210222011010200 is an apocalyptic number.
10222011010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10222011010200 is an abundant number, since it is smaller than the sum of its proper divisors (24346971701160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222011010200 is a wasteful number, since it uses less digits than its factorization.
10222011010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1548789577 (or 1548789568 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10222011010200 its reverse (201011022201), we get a palindrome (10423022032401).
The spelling of 10222011010200 in words is "ten trillion, two hundred twenty-two billion, eleven million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •