Base | Representation |
---|---|
bin | 110000000001100101… |
… | …0001111100101010111 |
3 | 100212012110111012211011 |
4 | 1200003022033211113 |
5 | 3142203322411043 |
6 | 115213413353051 |
7 | 10310466336202 |
oct | 1400312174527 |
9 | 325173435734 |
10 | 103132232023 |
11 | 3a813502407 |
12 | 17ba2938787 |
13 | 9957711682 |
14 | 4dc5048939 |
15 | 2a391ed59d |
hex | 180328f957 |
103132232023 has 4 divisors (see below), whose sum is σ = 105326534880. Its totient is φ = 100937929168.
The previous prime is 103132232003. The next prime is 103132232033. The reversal of 103132232023 is 320232231301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103132232023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103132231985 and 103132232003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103132232003) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1097151358 + ... + 1097151451.
It is an arithmetic number, because the mean of its divisors is an integer number (26331633720).
Almost surely, 2103132232023 is an apocalyptic number.
103132232023 is a deficient number, since it is larger than the sum of its proper divisors (2194302857).
103132232023 is an equidigital number, since it uses as much as digits as its factorization.
103132232023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2194302856.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 103132232023 its reverse (320232231301), we get a palindrome (423364463324).
The spelling of 103132232023 in words is "one hundred three billion, one hundred thirty-two million, two hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •