Base | Representation |
---|---|
bin | 110000000111000000… |
… | …0000011110000100010 |
3 | 100212200010201122120220 |
4 | 1200032000003300202 |
5 | 3143041403032042 |
6 | 115243431543510 |
7 | 10315135313136 |
oct | 1401600036042 |
9 | 325603648526 |
10 | 103314111522 |
11 | 3a8a7139146 |
12 | 1803382ab96 |
13 | 99862c2b8b |
14 | 50012713c6 |
15 | 2a4a1788ec |
hex | 180e003c22 |
103314111522 has 8 divisors (see below), whose sum is σ = 206628223056. Its totient is φ = 34438037172.
The previous prime is 103314111521. The next prime is 103314111569. The reversal of 103314111522 is 225111413301.
It is a sphenic number, since it is the product of 3 distinct primes.
103314111522 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 103314111492 and 103314111501.
It is not an unprimeable number, because it can be changed into a prime (103314111521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8609509288 + ... + 8609509299.
It is an arithmetic number, because the mean of its divisors is an integer number (25828527882).
Almost surely, 2103314111522 is an apocalyptic number.
103314111522 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.
103314111522 is a wasteful number, since it uses less digits than its factorization.
103314111522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17219018592.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 103314111522 its reverse (225111413301), we get a palindrome (328425524823).
The spelling of 103314111522 in words is "one hundred three billion, three hundred fourteen million, one hundred eleven thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •