Base | Representation |
---|---|
bin | 101110101010110100… |
… | …0110100110101000001 |
3 | 100120200120111222111222 |
4 | 1131111220310311001 |
5 | 3120223034411223 |
6 | 114012500044425 |
7 | 10145366362121 |
oct | 1352550646501 |
9 | 316616458458 |
10 | 100221013313 |
11 | 3955a170733 |
12 | 1750b993715 |
13 | 95b2543455 |
14 | 4bca552c81 |
15 | 29188450c8 |
hex | 1755a34d41 |
100221013313 has 4 divisors (see below), whose sum is σ = 100262140500. Its totient is φ = 100179886128.
The previous prime is 100221013309. The next prime is 100221013327. The reversal of 100221013313 is 313310122001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 94367539249 + 5853474064 = 307193^2 + 76508^2 .
It is a cyclic number.
It is not a de Polignac number, because 100221013313 - 22 = 100221013309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100221013291 and 100221013300.
It is not an unprimeable number, because it can be changed into a prime (100221012313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20559938 + ... + 20564811.
It is an arithmetic number, because the mean of its divisors is an integer number (25065535125).
Almost surely, 2100221013313 is an apocalyptic number.
It is an amenable number.
100221013313 is a deficient number, since it is larger than the sum of its proper divisors (41127187).
100221013313 is an equidigital number, since it uses as much as digits as its factorization.
100221013313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41127186.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100221013313 its reverse (313310122001), we get a palindrome (413531135314).
The spelling of 100221013313 in words is "one hundred billion, two hundred twenty-one million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •