Base | Representation |
---|---|
bin | 10111011011001001110010… |
… | …001010111011101001100011 |
3 | 111111202201012200201200022202 |
4 | 113123021302022323221203 |
5 | 102000344002230431433 |
6 | 1003035110003123415 |
7 | 30462010305204632 |
oct | 2733116212735143 |
9 | 444681180650282 |
10 | 103021001030243 |
11 | 2a909a6336979a |
12 | b67a1b097356b |
13 | 4563ab985b85a |
14 | 1b62358d29519 |
15 | bd9c2cab5ee8 |
hex | 5db2722bba63 |
103021001030243 has 2 divisors, whose sum is σ = 103021001030244. Its totient is φ = 103021001030242.
The previous prime is 103021001030147. The next prime is 103021001030263. The reversal of 103021001030243 is 342030100120301.
It is an a-pointer prime, because the next prime (103021001030263) can be obtained adding 103021001030243 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103021001030243 - 28 = 103021001029987 is a prime.
It is a super-2 number, since 2×1030210010302432 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103021001030263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510500515121 + 51510500515122.
It is an arithmetic number, because the mean of its divisors is an integer number (51510500515122).
Almost surely, 2103021001030243 is an apocalyptic number.
103021001030243 is a deficient number, since it is larger than the sum of its proper divisors (1).
103021001030243 is an equidigital number, since it uses as much as digits as its factorization.
103021001030243 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 103021001030243 its reverse (342030100120301), we get a palindrome (445051101150544).
The spelling of 103021001030243 in words is "one hundred three trillion, twenty-one billion, one million, thirty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •