Base | Representation |
---|---|
bin | 10111011100010011011000… |
… | …001001000000100000010011 |
3 | 111112001021011202010220000201 |
4 | 113130103120021000200103 |
5 | 102003142320412310303 |
6 | 1003135255040000031 |
7 | 30500505431526040 |
oct | 2734233011004023 |
9 | 445037152126021 |
10 | 103100021213203 |
11 | 2a93a523187823 |
12 | b691584600017 |
13 | 456b3a09a1c71 |
14 | 1b660d38cc1c7 |
15 | bdbd0503d81d |
hex | 5dc4d8240813 |
103100021213203 has 8 divisors (see below), whose sum is σ = 117828661110272. Its totient is φ = 88371397675656.
The previous prime is 103100021213153. The next prime is 103100021213261. The reversal of 103100021213203 is 302312120001301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103100021213203 - 213 = 103100021205011 is a prime.
It is a super-2 number, since 2×1031000212132032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103100021213263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15981526 + ... + 21485092.
It is an arithmetic number, because the mean of its divisors is an integer number (14728582638784).
Almost surely, 2103100021213203 is an apocalyptic number.
103100021213203 is a deficient number, since it is larger than the sum of its proper divisors (14728639897069).
103100021213203 is an equidigital number, since it uses as much as digits as its factorization.
103100021213203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8179761.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103100021213203 its reverse (302312120001301), we get a palindrome (405412141214504).
The spelling of 103100021213203 in words is "one hundred three trillion, one hundred billion, twenty-one million, two hundred thirteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •