Base | Representation |
---|---|
bin | 101111111110010011… |
… | …0001000101001010010 |
3 | 100211220210021002100222 |
4 | 1133330212020221102 |
5 | 3141442124244442 |
6 | 115154441113042 |
7 | 10304661266531 |
oct | 1377446105122 |
9 | 324823232328 |
10 | 103022103122 |
11 | 3a767322994 |
12 | 17b71a88782 |
13 | 993a962743 |
14 | 4db457c318 |
15 | 2a2e6e78d2 |
hex | 17fc988a52 |
103022103122 has 8 divisors (see below), whose sum is σ = 154544560716. Its totient is φ = 51507249552.
The previous prime is 103022103113. The next prime is 103022103131. The reversal of 103022103122 is 221301220301.
It is an interprime number because it is at equal distance from previous prime (103022103113) and next prime (103022103131).
It can be written as a sum of positive squares in 2 ways, for example, as 87752805361 + 15269297761 = 296231^2 + 123569^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030221031222 (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 103022103122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1867013 + ... + 1921400.
Almost surely, 2103022103122 is an apocalyptic number.
103022103122 is a deficient number, since it is larger than the sum of its proper divisors (51522457594).
103022103122 is a wasteful number, since it uses less digits than its factorization.
103022103122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3802012.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 103022103122 its reverse (221301220301), we get a palindrome (324323323423).
The spelling of 103022103122 in words is "one hundred three billion, twenty-two million, one hundred three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •