Base | Representation |
---|---|
bin | 110000000010100111… |
… | …1110000000001001111 |
3 | 100212021220100022001200 |
4 | 1200011033300001033 |
5 | 3142241302330111 |
6 | 115221103440543 |
7 | 10311402662205 |
oct | 1400517600117 |
9 | 325256308050 |
10 | 103167230031 |
11 | 3a831236988 |
12 | 17bb25b6153 |
13 | 9961a46558 |
14 | 4dc9959075 |
15 | 2a3c313256 |
hex | 18053f004f |
103167230031 has 12 divisors (see below), whose sum is σ = 149775778152. Its totient is φ = 68429024496.
The previous prime is 103167230003. The next prime is 103167230051. The reversal of 103167230031 is 130032761301.
103167230031 is a `hidden beast` number, since 10 + 316 + 7 + 2 + 300 + 31 = 666.
It is not a de Polignac number, because 103167230031 - 225 = 103133675599 is a prime.
It is a super-2 number, since 2×1031672300312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103167229977 and 103167230004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103167230051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29092201 + ... + 29095746.
It is an arithmetic number, because the mean of its divisors is an integer number (12481314846).
Almost surely, 2103167230031 is an apocalyptic number.
103167230031 is a deficient number, since it is larger than the sum of its proper divisors (46608548121).
103167230031 is a wasteful number, since it uses less digits than its factorization.
103167230031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58188150 (or 58188147 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
Adding to 103167230031 its reverse (130032761301), we get a palindrome (233199991332).
The spelling of 103167230031 in words is "one hundred three billion, one hundred sixty-seven million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •