Base | Representation |
---|---|
bin | 101111111110010011… |
… | …1000010100110011001 |
3 | 100211220210201010222221 |
4 | 1133330213002212121 |
5 | 3141442204344010 |
6 | 115154450144041 |
7 | 10304663305600 |
oct | 1377447024631 |
9 | 324823633887 |
10 | 103022340505 |
11 | 3a767475277 |
12 | 17b71b82021 |
13 | 993aa167c6 |
14 | 4db4600a37 |
15 | 2a2e742dda |
hex | 17fc9c2999 |
103022340505 has 12 divisors (see below), whose sum is σ = 143810777700. Its totient is φ = 70643890464.
The previous prime is 103022340479. The next prime is 103022340511. The reversal of 103022340505 is 505043220301.
It can be written as a sum of positive squares in 2 ways, for example, as 62334609561 + 40687730944 = 249669^2 + 201712^2 .
It is not a de Polignac number, because 103022340505 - 29 = 103022339993 is a prime.
It is a super-2 number, since 2×1030223405052 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103022340505.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 210249430 + ... + 210249919.
It is an arithmetic number, because the mean of its divisors is an integer number (11984231475).
Almost surely, 2103022340505 is an apocalyptic number.
It is an amenable number.
103022340505 is a deficient number, since it is larger than the sum of its proper divisors (40788437195).
103022340505 is an equidigital number, since it uses as much as digits as its factorization.
103022340505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420499368 (or 420499361 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 103022340505 its reverse (505043220301), we get a palindrome (608065560806).
The spelling of 103022340505 in words is "one hundred three billion, twenty-two million, three hundred forty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •