Base | Representation |
---|---|
bin | 11101011110111001100… |
… | …00100100001000111101 |
3 | 10120211210011210102211022 |
4 | 32233130300210020331 |
5 | 113044131341024041 |
6 | 2053213032233525 |
7 | 133121414464304 |
oct | 16573460441075 |
9 | 3524704712738 |
10 | 1013021033021 |
11 | 36068aa66808 |
12 | 1443b683b8a5 |
13 | 746b1b22bca |
14 | 3705d8c943b |
15 | 1b53e97024b |
hex | ebdcc2423d |
1013021033021 has 4 divisors (see below), whose sum is σ = 1025226105792. Its totient is φ = 1000815960252.
The previous prime is 1013021032927. The next prime is 1013021033023. The reversal of 1013021033021 is 1203301203101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013021033021 is a prime.
It is a super-2 number, since 2×10130210330212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013021033023) 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, 6102536261 + ... + 6102536426.
It is an arithmetic number, because the mean of its divisors is an integer number (256306526448).
Almost surely, 21013021033021 is an apocalyptic number.
It is an amenable number.
1013021033021 is a deficient number, since it is larger than the sum of its proper divisors (12205072771).
1013021033021 is an equidigital number, since it uses as much as digits as its factorization.
1013021033021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12205072770.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1013021033021 its reverse (1203301203101), we get a palindrome (2216322236122).
The spelling of 1013021033021 in words is "one trillion, thirteen billion, twenty-one million, thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •