Base | Representation |
---|---|
bin | 11110100110110001110… |
… | …111000010100001010111 |
3 | 21110001210020010201110112 |
4 | 132212301313002201113 |
5 | 233424400042100343 |
6 | 4250112440113235 |
7 | 304644553361306 |
oct | 36466167024127 |
9 | 7401706121415 |
10 | 2103223003223 |
11 | 740a76610a11 |
12 | 29b75116581b |
13 | 123443a079c4 |
14 | 73b219a643d |
15 | 39a9a15b218 |
hex | 1e9b1dc2857 |
2103223003223 has 36 divisors (see below), whose sum is σ = 2258390316168. Its totient is φ = 1957857501600.
The previous prime is 2103223003201. The next prime is 2103223003249. The reversal of 2103223003223 is 3223003223012.
It is a de Polignac number, because none of the positive numbers 2k-2103223003223 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 a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2103223003823) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 452206448 + ... + 452211098.
It is an arithmetic number, because the mean of its divisors is an integer number (62733064338).
Almost surely, 22103223003223 is an apocalyptic number.
2103223003223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2103223003223 is a deficient number, since it is larger than the sum of its proper divisors (155167312945).
2103223003223 is an equidigital number, since it uses as much as digits as its factorization.
2103223003223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5004 (or 4854 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 2103223003223 its reverse (3223003223012), we get a palindrome (5326226226235).
The spelling of 2103223003223 in words is "two trillion, one hundred three billion, two hundred twenty-three million, three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •