Base | Representation |
---|---|
bin | 11101100011110001000011… |
… | …100010110001001001011001 |
3 | 122001021222211101020102011122 |
4 | 131203301003202301021121 |
5 | 114014414431021144001 |
6 | 1140253421152535025 |
7 | 36245164002464462 |
oct | 3543610342611131 |
9 | 561258741212148 |
10 | 130001203303001 |
11 | 3847122315a618 |
12 | 126b712bb51475 |
13 | 57700a3964bb4 |
14 | 241613dd0bd69 |
15 | 100696a037b1b |
hex | 763c438b1259 |
130001203303001 has 2 divisors, whose sum is σ = 130001203303002. Its totient is φ = 130001203303000.
The previous prime is 130001203302991. The next prime is 130001203303039. The reversal of 130001203303001 is 100303302100031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99439268261776 + 30561935041225 = 9971924^2 + 5528285^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130001203303001 is a prime.
It is a super-2 number, since 2×1300012033030012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130001203303801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65000601651500 + 65000601651501.
It is an arithmetic number, because the mean of its divisors is an integer number (65000601651501).
Almost surely, 2130001203303001 is an apocalyptic number.
It is an amenable number.
130001203303001 is a deficient number, since it is larger than the sum of its proper divisors (1).
130001203303001 is an equidigital number, since it uses as much as digits as its factorization.
130001203303001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 130001203303001 its reverse (100303302100031), we get a palindrome (230304505403032).
The spelling of 130001203303001 in words is "one hundred thirty trillion, one billion, two hundred three million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •