Base | Representation |
---|---|
bin | 101111111110010001… |
… | …0110111000000000111 |
3 | 100211220201122110110022 |
4 | 1133330202313000013 |
5 | 3141441414310143 |
6 | 115154410445355 |
7 | 10304651062166 |
oct | 1377442670007 |
9 | 324821573408 |
10 | 103021244423 |
11 | 3a766896819 |
12 | 17b7173385b |
13 | 993a721936 |
14 | 4db43d73dd |
15 | 2a2e5c8268 |
hex | 17fc8b7007 |
103021244423 has 2 divisors, whose sum is σ = 103021244424. Its totient is φ = 103021244422.
The previous prime is 103021244407. The next prime is 103021244449. The reversal of 103021244423 is 324442120301.
It is an a-pointer prime, because the next prime (103021244449) can be obtained adding 103021244423 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103021244423 - 24 = 103021244407 is a prime.
It is a super-2 number, since 2×1030212444232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103021244392 and 103021244401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103021244023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510622211 + 51510622212.
It is an arithmetic number, because the mean of its divisors is an integer number (51510622212).
Almost surely, 2103021244423 is an apocalyptic number.
103021244423 is a deficient number, since it is larger than the sum of its proper divisors (1).
103021244423 is an equidigital number, since it uses as much as digits as its factorization.
103021244423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 103021244423 its reverse (324442120301), we get a palindrome (427463364724).
The spelling of 103021244423 in words is "one hundred three billion, twenty-one million, two hundred forty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •