Base | Representation |
---|---|
bin | 10111011110001100101110… |
… | …000001011111011100001111 |
3 | 111112111201110212120000121220 |
4 | 113132030232001133130033 |
5 | 102012311134120232343 |
6 | 1003315203352254423 |
7 | 30513100225361634 |
oct | 2736145601373417 |
9 | 445451425500556 |
10 | 103230311102223 |
11 | 2a98a802454858 |
12 | b6b28863a1413 |
13 | 457a765944356 |
14 | 1b6c53369818b |
15 | be03cd565183 |
hex | 5de32e05f70f |
103230311102223 has 8 divisors (see below), whose sum is σ = 137640763047936. Its totient is φ = 68820033279000.
The previous prime is 103230311102207. The next prime is 103230311102231. The reversal of 103230311102223 is 322201113032301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103230311102223 - 24 = 103230311102207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103230311102193 and 103230311102202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103230311102123) 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, 42140943 + ... + 44523248.
It is an arithmetic number, because the mean of its divisors is an integer number (17205095380992).
Almost surely, 2103230311102223 is an apocalyptic number.
103230311102223 is a deficient number, since it is larger than the sum of its proper divisors (34410451945713).
103230311102223 is an equidigital number, since it uses as much as digits as its factorization.
103230311102223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87061245.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 103230311102223 its reverse (322201113032301), we get a palindrome (425431424134524).
The spelling of 103230311102223 in words is "one hundred three trillion, two hundred thirty billion, three hundred eleven million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •