Base | Representation |
---|---|
bin | 110000001010001110… |
… | …0000000111010110111 |
3 | 100212221122221012100112 |
4 | 1200110130000322313 |
5 | 3143302024300343 |
6 | 115302250333235 |
7 | 10320616241555 |
oct | 1402434007267 |
9 | 325848835315 |
10 | 103422103223 |
11 | 3a95209898a |
12 | 18063a2a21b |
13 | 99a27a40aa |
14 | 5011742bd5 |
15 | 2a548ab218 |
hex | 1814700eb7 |
103422103223 has 4 divisors (see below), whose sum is σ = 106217295240. Its totient is φ = 100626911208.
The previous prime is 103422103219. The next prime is 103422103237. The reversal of 103422103223 is 322301224301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322301224301 = 7 ⋅46043032043.
It is a cyclic number.
It is not a de Polignac number, because 103422103223 - 22 = 103422103219 is a prime.
It is a super-2 number, since 2×1034221032232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103422103273) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1397595953 + ... + 1397596026.
It is an arithmetic number, because the mean of its divisors is an integer number (26554323810).
Almost surely, 2103422103223 is an apocalyptic number.
103422103223 is a deficient number, since it is larger than the sum of its proper divisors (2795192017).
103422103223 is an equidigital number, since it uses as much as digits as its factorization.
103422103223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2795192016.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 103422103223 its reverse (322301224301), we get a palindrome (425723327524).
The spelling of 103422103223 in words is "one hundred three billion, four hundred twenty-two million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •