Base | Representation |
---|---|
bin | 11101100011110010111011… |
… | …110111011111011000110011 |
3 | 122001022012001001202220111201 |
4 | 131203302323313133120303 |
5 | 114014433044313014303 |
6 | 1140254353344352031 |
7 | 36245265014234125 |
oct | 3543627367373063 |
9 | 561265031686451 |
10 | 130003222001203 |
11 | 38472069708441 |
12 | 126b75b4015617 |
13 | 5770335c57c85 |
14 | 2416292073215 |
15 | 1006a3739081d |
hex | 763cbbddf633 |
130003222001203 has 4 divisors (see below), whose sum is σ = 131784088056088. Its totient is φ = 128222355946320.
The previous prime is 130003222001201. The next prime is 130003222001209. The reversal of 130003222001203 is 302100222300031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130003222001203 - 21 = 130003222001201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130003222001201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 890433027333 + ... + 890433027478.
It is an arithmetic number, because the mean of its divisors is an integer number (32946022014022).
Almost surely, 2130003222001203 is an apocalyptic number.
130003222001203 is a deficient number, since it is larger than the sum of its proper divisors (1780866054885).
130003222001203 is an equidigital number, since it uses as much as digits as its factorization.
130003222001203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1780866054884.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 130003222001203 its reverse (302100222300031), we get a palindrome (432103444301234).
The spelling of 130003222001203 in words is "one hundred thirty trillion, three billion, two hundred twenty-two million, one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •