Base | Representation |
---|---|
bin | 110000000100100011… |
… | …0111100110101100111 |
3 | 100212110102021120210102 |
4 | 1200021012330311213 |
5 | 3142404400011403 |
6 | 115231340414315 |
7 | 10313120536424 |
oct | 1401106746547 |
9 | 325412246712 |
10 | 103232032103 |
11 | 3a864877712 |
12 | 1801024739b |
13 | 99722b5185 |
14 | 4dd43c6d4b |
15 | 2a42d63b88 |
hex | 18091bcd67 |
103232032103 has 4 divisors (see below), whose sum is σ = 103251108648. Its totient is φ = 103212955560.
The previous prime is 103232032091. The next prime is 103232032159. The reversal of 103232032103 is 301230232301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301230232301 = 26209 ⋅11493389.
It is a cyclic number.
It is not a de Polignac number, because 103232032103 - 26 = 103232032039 is a prime.
It is a super-2 number, since 2×1032320321032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103232032193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9530153 + ... + 9540978.
It is an arithmetic number, because the mean of its divisors is an integer number (25812777162).
Almost surely, 2103232032103 is an apocalyptic number.
103232032103 is a deficient number, since it is larger than the sum of its proper divisors (19076545).
103232032103 is an equidigital number, since it uses as much as digits as its factorization.
103232032103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19076544.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 103232032103 its reverse (301230232301), we get a palindrome (404462264404).
The spelling of 103232032103 in words is "one hundred three billion, two hundred thirty-two million, thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •