Base | Representation |
---|---|
bin | 10111011110000011001111… |
… | …001111100011110110110011 |
3 | 111112110202012101221021102101 |
4 | 113132003033033203312303 |
5 | 102012124312020121321 |
6 | 1003310401254001231 |
7 | 30512260033200352 |
oct | 2736031717436663 |
9 | 445422171837371 |
10 | 103220131020211 |
11 | 2a986459021537 |
12 | b6b0905046217 |
13 | 457980285489a |
14 | 1b6bc49659999 |
15 | bdeed4984791 |
hex | 5de0cf3e3db3 |
103220131020211 has 8 divisors (see below), whose sum is σ = 104624904854960. Its totient is φ = 101824816942368.
The previous prime is 103220131020157. The next prime is 103220131020221. The reversal of 103220131020211 is 112020131022301.
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 103220131020211 - 211 = 103220131018163 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103220131020221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2364917256 + ... + 2364960901.
It is an arithmetic number, because the mean of its divisors is an integer number (13078113106870).
Almost surely, 2103220131020211 is an apocalyptic number.
103220131020211 is a deficient number, since it is larger than the sum of its proper divisors (1404773834749).
103220131020211 is a wasteful number, since it uses less digits than its factorization.
103220131020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4729878453.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 103220131020211 its reverse (112020131022301), we get a palindrome (215240262042512).
The spelling of 103220131020211 in words is "one hundred three trillion, two hundred twenty billion, one hundred thirty-one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •