Base | Representation |
---|---|
bin | 10111011111010111001110… |
… | …111111000101000111100110 |
3 | 111112210100222220022121221220 |
4 | 113133113032333011013212 |
5 | 102020114014134410342 |
6 | 1003420034542321210 |
7 | 30521632030402401 |
oct | 2737271677050746 |
9 | 445710886277856 |
10 | 103310321013222 |
11 | 2aa1072aa10144 |
12 | b706295589206 |
13 | 4585176b3935b |
14 | 1b72363892d38 |
15 | be25128405ec |
hex | 5df5cefc51e6 |
103310321013222 has 8 divisors (see below), whose sum is σ = 206620642026456. Its totient is φ = 34436773671072.
The previous prime is 103310321013187. The next prime is 103310321013239. The reversal of 103310321013222 is 222310123013301.
It is a sphenic number, since it is the product of 3 distinct primes.
103310321013222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 103310321013192 and 103310321013201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8609193417763 + ... + 8609193417774.
It is an arithmetic number, because the mean of its divisors is an integer number (25827580253307).
Almost surely, 2103310321013222 is an apocalyptic number.
103310321013222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103310321013222 is a wasteful number, since it uses less digits than its factorization.
103310321013222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17218386835542.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 103310321013222 its reverse (222310123013301), we get a palindrome (325620444026523).
The spelling of 103310321013222 in words is "one hundred three trillion, three hundred ten billion, three hundred twenty-one million, thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •