Base | Representation |
---|---|
bin | 101111111110100101… |
… | …1111001010111101111 |
3 | 100211221110220000010020 |
4 | 1133331023321113233 |
5 | 3142002143031111 |
6 | 115155433213223 |
7 | 10305141365400 |
oct | 1377513712757 |
9 | 324843800106 |
10 | 103032002031 |
11 | 3a771974102 |
12 | 17b75261213 |
13 | 993ca1a29a |
14 | 4db59d79a7 |
15 | 2a30500906 |
hex | 17fd2f95ef |
103032002031 has 48 divisors (see below), whose sum is σ = 168441183360. Its totient is φ = 55701898560.
The previous prime is 103032002009. The next prime is 103032002057. The reversal of 103032002031 is 130200230301.
It is not a de Polignac number, because 103032002031 - 217 = 103031870959 is a prime.
It is a super-2 number, since 2×1030320020312 (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 103032002031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103032002071) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2089936 + ... + 2138666.
It is an arithmetic number, because the mean of its divisors is an integer number (3509191320).
Almost surely, 2103032002031 is an apocalyptic number.
103032002031 is a deficient number, since it is larger than the sum of its proper divisors (65409181329).
103032002031 is a wasteful number, since it uses less digits than its factorization.
103032002031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49524 (or 49517 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 103032002031 its reverse (130200230301), we get a palindrome (233232232332).
The spelling of 103032002031 in words is "one hundred three billion, thirty-two million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •