Base | Representation |
---|---|
bin | 110000000011101100… |
… | …0010100101111010110 |
3 | 100212101101201020011100 |
4 | 1200013120110233112 |
5 | 3142324434011042 |
6 | 115224423050530 |
7 | 10312316204166 |
oct | 1400730245726 |
9 | 325341636140 |
10 | 103203032022 |
11 | 3a84a46a502 |
12 | 180025a0a46 |
13 | 99692a036c |
14 | 4dd05d85a6 |
15 | 2a4053624c |
hex | 1807614bd6 |
103203032022 has 24 divisors (see below), whose sum is σ = 223623596664. Its totient is φ = 34398391104.
The previous prime is 103203031927. The next prime is 103203032039. The reversal of 103203032022 is 220230302301.
It is a happy number.
103203032022 is a `hidden beast` number, since 1 + 0 + 320 + 3 + 0 + 320 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 103203031986 and 103203032004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32433 + ... + 455475.
It is an arithmetic number, because the mean of its divisors is an integer number (9317649861).
Almost surely, 2103203032022 is an apocalyptic number.
103203032022 is an abundant number, since it is smaller than the sum of its proper divisors (120420564642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103203032022 is a wasteful number, since it uses less digits than its factorization.
103203032022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436604 (or 436601 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 103203032022 its reverse (220230302301), we get a palindrome (323433334323).
The spelling of 103203032022 in words is "one hundred three billion, two hundred three million, thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •