Base | Representation |
---|---|
bin | 10111011110001111100001… |
… | …100011110100100001001001 |
3 | 111112112000020210101121200212 |
4 | 113132033201203310201021 |
5 | 102012333321221114423 |
6 | 1003320422312410505 |
7 | 30513234662106326 |
oct | 2736174143644111 |
9 | 445460223347625 |
10 | 103233323223113 |
11 | 2a991008743866 |
12 | b6b33870a6a35 |
13 | 457ab259b08c5 |
14 | 1b6c73b737b4d |
15 | be0507c00578 |
hex | 5de3e18f4849 |
103233323223113 has 16 divisors (see below), whose sum is σ = 109613761608960. Its totient is φ = 96887111717376.
The previous prime is 103233323223073. The next prime is 103233323223263. The reversal of 103233323223113 is 311322323332301.
It is a happy number.
It is not a de Polignac number, because 103233323223113 - 210 = 103233323222089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103233323223113.
It is not an unprimeable number, because it can be changed into a prime (103233323723113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 209165756 + ... + 209658722.
It is an arithmetic number, because the mean of its divisors is an integer number (6850860100560).
Almost surely, 2103233323223113 is an apocalyptic number.
It is an amenable number.
103233323223113 is a deficient number, since it is larger than the sum of its proper divisors (6380438385847).
103233323223113 is a wasteful number, since it uses less digits than its factorization.
103233323223113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 527656.
The product of its (nonzero) digits is 34992, while the sum is 32.
Adding to 103233323223113 its reverse (311322323332301), we get a palindrome (414555646555414).
The spelling of 103233323223113 in words is "one hundred three trillion, two hundred thirty-three billion, three hundred twenty-three million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •