Base | Representation |
---|---|
bin | 10111011110000110000000… |
… | …111011111100010100111011 |
3 | 111112111000220011121000110212 |
4 | 113132012000323330110323 |
5 | 102012201413212101021 |
6 | 1003312013151301335 |
7 | 30512423643040655 |
oct | 2736060073742473 |
9 | 445430804530425 |
10 | 103223112222011 |
11 | 2a987748912581 |
12 | b6b13b751a84b |
13 | 4579b89386a12 |
14 | 1b6c04d56b6d5 |
15 | be010b56385b |
hex | 5de180efc53b |
103223112222011 has 8 divisors (see below), whose sum is σ = 108158007544224. Its totient is φ = 98325461393280.
The previous prime is 103223112222007. The next prime is 103223112222029. The reversal of 103223112222011 is 110222211322301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103223112222011 - 22 = 103223112222007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103223112222001) 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, 9311117696 + ... + 9311128781.
It is an arithmetic number, because the mean of its divisors is an integer number (13519750943028).
Almost surely, 2103223112222011 is an apocalyptic number.
103223112222011 is a deficient number, since it is larger than the sum of its proper divisors (4934895322213).
103223112222011 is a wasteful number, since it uses less digits than its factorization.
103223112222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18622246741.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 103223112222011 its reverse (110222211322301), we get a palindrome (213445323544312).
The spelling of 103223112222011 in words is "one hundred three trillion, two hundred twenty-three billion, one hundred twelve million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •