Base | Representation |
---|---|
bin | 11101101111101001011… |
… | …10101100011001010001 |
3 | 10121200222212000022101001 |
4 | 32313310232230121101 |
5 | 113221040330132241 |
6 | 2101301212142001 |
7 | 133560303162361 |
oct | 16676456543121 |
9 | 3550885008331 |
10 | 1022013130321 |
11 | 36448484a587 |
12 | 1460a6167901 |
13 | 754b5a67141 |
14 | 37673c449a1 |
15 | 1b8b90da431 |
hex | edf4bac651 |
1022013130321 has 4 divisors (see below), whose sum is σ = 1022044342000. Its totient is φ = 1021981918644.
The previous prime is 1022013130309. The next prime is 1022013130423. The reversal of 1022013130321 is 1230313102201.
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 not a de Polignac number, because 1022013130321 - 213 = 1022013122129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022013130121) 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 3 ways as a sum of consecutive naturals, for example, 15556671 + ... + 15622228.
It is an arithmetic number, because the mean of its divisors is an integer number (255511085500).
Almost surely, 21022013130321 is an apocalyptic number.
It is an amenable number.
1022013130321 is a deficient number, since it is larger than the sum of its proper divisors (31211679).
1022013130321 is an equidigital number, since it uses as much as digits as its factorization.
1022013130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31211678.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1022013130321 its reverse (1230313102201), we get a palindrome (2252326232522).
The spelling of 1022013130321 in words is "one trillion, twenty-two billion, thirteen million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •