Base | Representation |
---|---|
bin | 10111000010011010101111… |
… | …010101010011111010000011 |
3 | 111021202012210001001100210001 |
4 | 113002122233111103322003 |
5 | 101240021324322041003 |
6 | 555254154223020431 |
7 | 30225134200612453 |
oct | 2702325725237203 |
9 | 437665701040701 |
10 | 101321220112003 |
11 | 2a3140a7350611 |
12 | b44489373a717 |
13 | 446c71c631878 |
14 | 1b03d8a729d63 |
15 | baa8e662061d |
hex | 5c26af553e83 |
101321220112003 has 2 divisors, whose sum is σ = 101321220112004. Its totient is φ = 101321220112002.
The previous prime is 101321220111989. The next prime is 101321220112031. The reversal of 101321220112003 is 300211022123101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101321220112003 - 213 = 101321220103811 is a prime.
It is a super-2 number, since 2×1013212201120032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101321220112043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50660610056001 + 50660610056002.
It is an arithmetic number, because the mean of its divisors is an integer number (50660610056002).
Almost surely, 2101321220112003 is an apocalyptic number.
101321220112003 is a deficient number, since it is larger than the sum of its proper divisors (1).
101321220112003 is an equidigital number, since it uses as much as digits as its factorization.
101321220112003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101321220112003 its reverse (300211022123101), we get a palindrome (401532242235104).
The spelling of 101321220112003 in words is "one hundred one trillion, three hundred twenty-one billion, two hundred twenty million, one hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •