Base | Representation |
---|---|
bin | 1001001100000101011011… |
… | …1111010101011011100111 |
3 | 1022202212011221121202102212 |
4 | 2103001112333111123213 |
5 | 2311012344431223443 |
6 | 33253204545554035 |
7 | 2061635162332355 |
oct | 223012677253347 |
9 | 38685157552385 |
10 | 10103222523623 |
11 | 32458307a6889 |
12 | 11720a494591b |
13 | 583964491778 |
14 | 26cdda15c7d5 |
15 | 127c1c029618 |
hex | 93056fd56e7 |
10103222523623 has 2 divisors, whose sum is σ = 10103222523624. Its totient is φ = 10103222523622.
The previous prime is 10103222523517. The next prime is 10103222523679. The reversal of 10103222523623 is 32632522230101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10103222523623 is a prime.
It is a super-2 number, since 2×101032225236232 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10103222523623.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103222525623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051611261811 + 5051611261812.
It is an arithmetic number, because the mean of its divisors is an integer number (5051611261812).
Almost surely, 210103222523623 is an apocalyptic number.
10103222523623 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103222523623 is an equidigital number, since it uses as much as digits as its factorization.
10103222523623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 10103222523623 its reverse (32632522230101), we get a palindrome (42735744753724).
The spelling of 10103222523623 in words is "ten trillion, one hundred three billion, two hundred twenty-two million, five hundred twenty-three thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •