Base | Representation |
---|---|
bin | 11101011110110111010… |
… | …11111001101000101011 |
3 | 10120211201220220221121201 |
4 | 32233123223321220223 |
5 | 113044112234030011 |
6 | 2053211150345031 |
7 | 133121105465425 |
oct | 16573353715053 |
9 | 3524656827551 |
10 | 1013003033131 |
11 | 360680892171 |
12 | 1443b07bb177 |
13 | 746ab18cc9b |
14 | 3705b361815 |
15 | 1b53d0b6cc1 |
hex | ebdbaf9a2b |
1013003033131 has 4 divisors (see below), whose sum is σ = 1013005619752. Its totient is φ = 1013000446512.
The previous prime is 1013003033123. The next prime is 1013003033137. The reversal of 1013003033131 is 1313303003101.
It is a happy number.
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 1013003033131 - 23 = 1013003033123 is a prime.
It is a super-2 number, since 2×10130030331312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013003033099 and 1013003033108.
It is not an unprimeable number, because it can be changed into a prime (1013003033137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 571626 + ... + 1533871.
It is an arithmetic number, because the mean of its divisors is an integer number (253251404938).
Almost surely, 21013003033131 is an apocalyptic number.
1013003033131 is a deficient number, since it is larger than the sum of its proper divisors (2586621).
1013003033131 is an equidigital number, since it uses as much as digits as its factorization.
1013003033131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2586620.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 1013003033131 its reverse (1313303003101), we get a palindrome (2326306036232).
The spelling of 1013003033131 in words is "one trillion, thirteen billion, three million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •