Base | Representation |
---|---|
bin | 10110110010000111011110… |
… | …010001100101011101011101 |
3 | 111010210010100110011120010112 |
4 | 112302013132101211131131 |
5 | 101113143142411401341 |
6 | 553035414052415405 |
7 | 30051166500145334 |
oct | 2662073621453535 |
9 | 433703313146115 |
10 | 100201021200221 |
11 | 29a220182611a7 |
12 | b2a3767317565 |
13 | 43babb9bb5ab6 |
14 | 1aa5a8079cd1b |
15 | b8b6d2711aeb |
hex | 5b21de46575d |
100201021200221 has 16 divisors (see below), whose sum is σ = 101616786881280. Its totient is φ = 98791793527680.
The previous prime is 100201021200209. The next prime is 100201021200253. The reversal of 100201021200221 is 122002120102001.
It is a cyclic number.
It is not a de Polignac number, because 100201021200221 - 210 = 100201021199197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201021200196 and 100201021200205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100201021205221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 186398336 + ... + 186935126.
It is an arithmetic number, because the mean of its divisors is an integer number (6351049180080).
Almost surely, 2100201021200221 is an apocalyptic number.
It is an amenable number.
100201021200221 is a deficient number, since it is larger than the sum of its proper divisors (1415765681059).
100201021200221 is an equidigital number, since it uses as much as digits as its factorization.
100201021200221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 542876.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100201021200221 its reverse (122002120102001), we get a palindrome (222203141302222).
The spelling of 100201021200221 in words is "one hundred trillion, two hundred one billion, twenty-one million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •