Base | Representation |
---|---|
bin | 10111011011010010011100… |
… | …101000010110100010001001 |
3 | 111111210121012222121222012110 |
4 | 113123102130220112202021 |
5 | 102001022030122221301 |
6 | 1003043245023332533 |
7 | 30462456651313545 |
oct | 2733223450264211 |
9 | 444717188558173 |
10 | 103030303320201 |
11 | 2a9129a7258934 |
12 | b67bb68151149 |
13 | 456493cb2c03a |
14 | 1b6299c54ca25 |
15 | bda0c45a50d6 |
hex | 5db49ca16889 |
103030303320201 has 4 divisors (see below), whose sum is σ = 137373737760272. Its totient is φ = 68686868880132.
The previous prime is 103030303320157. The next prime is 103030303320223. The reversal of 103030303320201 is 102023303030301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 103030303320201 - 211 = 103030303318153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103030303320001) 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, 17171717220031 + ... + 17171717220036.
It is an arithmetic number, because the mean of its divisors is an integer number (34343434440068).
Almost surely, 2103030303320201 is an apocalyptic number.
It is an amenable number.
103030303320201 is a deficient number, since it is larger than the sum of its proper divisors (34343434440071).
103030303320201 is an equidigital number, since it uses as much as digits as its factorization.
103030303320201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34343434440070.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 103030303320201 its reverse (102023303030301), we get a palindrome (205053606350502).
The spelling of 103030303320201 in words is "one hundred three trillion, thirty billion, three hundred three million, three hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •