Base | Representation |
---|---|
bin | 101111111101111110… |
… | …1000000110011110001 |
3 | 100211220000222101222200 |
4 | 1133323331000303301 |
5 | 3141431344314441 |
6 | 115153414053413 |
7 | 10304500541130 |
oct | 1377375006361 |
9 | 324800871880 |
10 | 103011323121 |
11 | 3a76122a7a3 |
12 | 17b6a34a269 |
13 | 9938659b45 |
14 | 4db2d73917 |
15 | 2a2d7b87b6 |
hex | 17fbf40cf1 |
103011323121 has 48 divisors (see below), whose sum is σ = 172347302400. Its totient is φ = 58069799424.
The previous prime is 103011323101. The next prime is 103011323123. The reversal of 103011323121 is 121323110301.
It is not a de Polignac number, because 103011323121 - 210 = 103011322097 is a prime.
It is a super-2 number, since 2×1030113231212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011323094 and 103011323103.
It is not an unprimeable number, because it can be changed into a prime (103011323123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6407325 + ... + 6423381.
It is an arithmetic number, because the mean of its divisors is an integer number (3590568800).
Almost surely, 2103011323121 is an apocalyptic number.
It is an amenable number.
103011323121 is a deficient number, since it is larger than the sum of its proper divisors (69335979279).
103011323121 is a wasteful number, since it uses less digits than its factorization.
103011323121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17438 (or 17435 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 103011323121 its reverse (121323110301), we get a palindrome (224334433422).
The spelling of 103011323121 in words is "one hundred three billion, eleven million, three hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •