Base | Representation |
---|---|
bin | 110000000100000001… |
… | …1010110101111110001 |
3 | 100212102011221022222100 |
4 | 1200020003112233301 |
5 | 3142340330444213 |
6 | 115225504531013 |
7 | 10312514115531 |
oct | 1401003265761 |
9 | 325364838870 |
10 | 103214312433 |
11 | 3a855874661 |
12 | 18006320a69 |
13 | 996b71c96b |
14 | 4dd1cd34c1 |
15 | 2a41513773 |
hex | 18080d6bf1 |
103214312433 has 12 divisors (see below), whose sum is σ = 149116633588. Its totient is φ = 68796021600.
The previous prime is 103214312417. The next prime is 103214312437. The reversal of 103214312433 is 334213412301.
It is a happy number.
103214312433 is a `hidden beast` number, since 1 + 0 + 3 + 214 + 3 + 12 + 433 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 6578507664 + 96635804769 = 81108^2 + 310863^2 .
It is not a de Polignac number, because 103214312433 - 24 = 103214312417 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103214312397 and 103214312406.
It is not an unprimeable number, because it can be changed into a prime (103214312437) 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, 1078210 + ... + 1170027.
Almost surely, 2103214312433 is an apocalyptic number.
It is an amenable number.
103214312433 is a deficient number, since it is larger than the sum of its proper divisors (45902321155).
103214312433 is a wasteful number, since it uses less digits than its factorization.
103214312433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2253344 (or 2253341 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 103214312433 its reverse (334213412301), we get a palindrome (437427724734).
The spelling of 103214312433 in words is "one hundred three billion, two hundred fourteen million, three hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •