Base | Representation |
---|---|
bin | 11101011011100001101… |
… | …00100001011001000101 |
3 | 10120200002222021002021120 |
4 | 32231300310201121011 |
5 | 113031424243143023 |
6 | 2052313222304153 |
7 | 133025505202515 |
oct | 16556064413105 |
9 | 3520088232246 |
10 | 1011210131013 |
11 | 35a940836285 |
12 | 143b90288059 |
13 | 744838b6864 |
14 | 36d2b1b5845 |
15 | 1b4859b18e3 |
hex | eb70d21645 |
1011210131013 has 8 divisors (see below), whose sum is σ = 1348300524576. Its totient is φ = 674129912400.
The previous prime is 1011210130999. The next prime is 1011210131021. The reversal of 1011210131013 is 3101310121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1011210131013 - 212 = 1011210126917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011210130983 and 1011210131001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011210131213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2308743 + ... + 2711588.
It is an arithmetic number, because the mean of its divisors is an integer number (168537565572).
Almost surely, 21011210131013 is an apocalyptic number.
It is an amenable number.
1011210131013 is a deficient number, since it is larger than the sum of its proper divisors (337090393563).
1011210131013 is an equidigital number, since it uses as much as digits as its factorization.
1011210131013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5087475.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 1011210131013 its reverse (3101310121101), we get a palindrome (4112520252114).
The spelling of 1011210131013 in words is "one trillion, eleven billion, two hundred ten million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •