Base | Representation |
---|---|
bin | 10010111011110000110… |
… | …111100001011010011101 |
3 | 11121101102101002211012221 |
4 | 102323300313201122131 |
5 | 132304144012210023 |
6 | 2433420555025341 |
7 | 163000665543262 |
oct | 22736067413235 |
9 | 4541371084187 |
10 | 1301121210013 |
11 | 461891003939 |
12 | 1901baa3b251 |
13 | 95906493211 |
14 | 46d90449269 |
15 | 23ca259a85d |
hex | 12ef0de169d |
1301121210013 has 8 divisors (see below), whose sum is σ = 1331643236000. Its totient is φ = 1270611156528.
The previous prime is 1301121210001. The next prime is 1301121210079. The reversal of 1301121210013 is 3100121211031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1301121210013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301121213013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2773038 + ... + 3208111.
It is an arithmetic number, because the mean of its divisors is an integer number (166455404500).
Almost surely, 21301121210013 is an apocalyptic number.
It is an amenable number.
1301121210013 is a deficient number, since it is larger than the sum of its proper divisors (30522025987).
1301121210013 is an equidigital number, since it uses as much as digits as its factorization.
1301121210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5986251.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1301121210013 its reverse (3100121211031), we get a palindrome (4401242421044).
The spelling of 1301121210013 in words is "one trillion, three hundred one billion, one hundred twenty-one million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •