Base | Representation |
---|---|
bin | 10111011100100111001101… |
… | …001010111111110111110011 |
3 | 111112010022010112120001001210 |
4 | 113130213031022333313303 |
5 | 102004014421334201003 |
6 | 1003153135435531203 |
7 | 30502161146442642 |
oct | 2734471512776763 |
9 | 445108115501053 |
10 | 103121312022003 |
11 | 2a9485592a6580 |
12 | b6957268b9b03 |
13 | 45703b4917192 |
14 | 1b671533c1359 |
15 | bdc64e281503 |
hex | 5dc9cd2bfdf3 |
103121312022003 has 16 divisors (see below), whose sum is σ = 150016510670976. Its totient is φ = 62488650277440.
The previous prime is 103121312021939. The next prime is 103121312022041. The reversal of 103121312022003 is 300220213121301.
It is not a de Polignac number, because 103121312022003 - 26 = 103121312021939 is a prime.
It is a super-2 number, since 2×1031213120220032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103121312522003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227634901 + ... + 228087462.
It is an arithmetic number, because the mean of its divisors is an integer number (9376031916936).
Almost surely, 2103121312022003 is an apocalyptic number.
103121312022003 is a deficient number, since it is larger than the sum of its proper divisors (46895198648973).
103121312022003 is a wasteful number, since it uses less digits than its factorization.
103121312022003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455729234.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103121312022003 its reverse (300220213121301), we get a palindrome (403341525143304).
The spelling of 103121312022003 in words is "one hundred three trillion, one hundred twenty-one billion, three hundred twelve million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •