Base | Representation |
---|---|
bin | 10111000000101011111010… |
… | …011000010010111001011101 |
3 | 111021022211121201112110121000 |
4 | 113000223322120102321131 |
5 | 101231044121321214323 |
6 | 555123354051500513 |
7 | 30213422233324500 |
oct | 2700537230227135 |
9 | 437284551473530 |
10 | 101202220101213 |
11 | 2a278690a02160 |
12 | b4258028b7739 |
13 | 446143667c7ba |
14 | 1adc2dc12b137 |
15 | ba777e347e43 |
hex | 5c0afa612e5d |
101202220101213 has 96 divisors (see below), whose sum is σ = 190267854387840. Its totient is φ = 52571151360000.
The previous prime is 101202220101173. The next prime is 101202220101221. The reversal of 101202220101213 is 312101022202101.
101202220101213 is a `hidden beast` number, since 10 + 120 + 2 + 220 + 101 + 213 = 666.
It is not a de Polignac number, because 101202220101213 - 26 = 101202220101149 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101202220105213) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 726430663 + ... + 726569963.
It is an arithmetic number, because the mean of its divisors is an integer number (1981956816540).
Almost surely, 2101202220101213 is an apocalyptic number.
It is an amenable number.
101202220101213 is a deficient number, since it is larger than the sum of its proper divisors (89065634286627).
101202220101213 is a wasteful number, since it uses less digits than its factorization.
101202220101213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189256 (or 189243 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 101202220101213 its reverse (312101022202101), we get a palindrome (413303242303314).
The spelling of 101202220101213 in words is "one hundred one trillion, two hundred two billion, two hundred twenty million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •