Base | Representation |
---|---|
bin | 110000000011100110… |
… | …1101001001100101001 |
3 | 100212101012102222120110 |
4 | 1200013031221030221 |
5 | 3142323224412413 |
6 | 115224243044533 |
7 | 10312253333430 |
oct | 1400715511451 |
9 | 325335388513 |
10 | 103200232233 |
11 | 3a848927a2a |
12 | 18001670749 |
13 | 996882cb97 |
14 | 4dd00aa117 |
15 | 2a401818c3 |
hex | 1807369329 |
103200232233 has 8 divisors (see below), whose sum is σ = 157257496768. Its totient is φ = 58971561264.
The previous prime is 103200232207. The next prime is 103200232241. The reversal of 103200232233 is 332232002301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103200232233 - 218 = 103199970089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4914296773 = 103200232233 / (1 + 0 + 3 + 2 + 0 + 0 + 2 + 3 + 2 + 2 + 3 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103200234233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2457148366 + ... + 2457148407.
It is an arithmetic number, because the mean of its divisors is an integer number (19657187096).
Almost surely, 2103200232233 is an apocalyptic number.
It is an amenable number.
103200232233 is a deficient number, since it is larger than the sum of its proper divisors (54057264535).
103200232233 is an equidigital number, since it uses as much as digits as its factorization.
103200232233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4914296783.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 103200232233 its reverse (332232002301), we get a palindrome (435432234534).
The spelling of 103200232233 in words is "one hundred three billion, two hundred million, two hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •