Base | Representation |
---|---|
bin | 10110110010001000100101… |
… | …101111011111011000111101 |
3 | 111010210020110000100011211001 |
4 | 112302020211233133120331 |
5 | 101113203121334101023 |
6 | 553040133043530301 |
7 | 30051241266520600 |
oct | 2662104557373075 |
9 | 433706400304731 |
10 | 100202220222013 |
11 | 29a22583059aa8 |
12 | b2a3a40989991 |
13 | 43bb04b426c50 |
14 | 1aa5b55b16337 |
15 | b8b752b076ad |
hex | 5b2225bdf63d |
100202220222013 has 24 divisors (see below), whose sum is σ = 125679844013472. Its totient is φ = 79185011490144.
The previous prime is 100202220221969. The next prime is 100202220222089. The reversal of 100202220222013 is 310222022202001.
It is not a de Polignac number, because 100202220222013 - 217 = 100202220090941 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100202220222913) 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, 94577995 + ... + 95631592.
It is an arithmetic number, because the mean of its divisors is an integer number (5236660167228).
Almost surely, 2100202220222013 is an apocalyptic number.
100202220222013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100202220222013 is a deficient number, since it is larger than the sum of its proper divisors (25477623791459).
100202220222013 is a wasteful number, since it uses less digits than its factorization.
100202220222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190210441 (or 190210434 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 100202220222013 its reverse (310222022202001), we get a palindrome (410424242424014).
The spelling of 100202220222013 in words is "one hundred trillion, two hundred two billion, two hundred twenty million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •