Base | Representation |
---|---|
bin | 110000000001100011… |
… | …0011011101111010001 |
3 | 100212012101121110201221 |
4 | 1200003012123233101 |
5 | 3142203043430413 |
6 | 115213340125041 |
7 | 10310455006240 |
oct | 1400306335721 |
9 | 325171543657 |
10 | 103131233233 |
11 | 3a81298aa66 |
12 | 17ba2536781 |
13 | 9957451b82 |
14 | 4dc4c68957 |
15 | 2a390a268d |
hex | 180319bbd1 |
103131233233 has 8 divisors (see below), whose sum is σ = 117885728768. Its totient is φ = 88382103264.
The previous prime is 103131233221. The next prime is 103131233237. The reversal of 103131233233 is 332332131301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103131233233 - 25 = 103131233201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103131233198 and 103131233207.
It is not an unprimeable number, because it can be changed into a prime (103131233237) 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 7 ways as a sum of consecutive naturals, for example, 1300116 + ... + 1377157.
It is an arithmetic number, because the mean of its divisors is an integer number (14735716096).
Almost surely, 2103131233233 is an apocalyptic number.
It is an amenable number.
103131233233 is a deficient number, since it is larger than the sum of its proper divisors (14754495535).
103131233233 is an equidigital number, since it uses as much as digits as its factorization.
103131233233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2682783.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 103131233233 its reverse (332332131301), we get a palindrome (435463364534).
The spelling of 103131233233 in words is "one hundred three billion, one hundred thirty-one million, two hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •