Base | Representation |
---|---|
bin | 11101001010011011010… |
… | …01111100011100101101 |
3 | 10112210102012122100021011 |
4 | 32211031221330130231 |
5 | 112404124214033401 |
6 | 2044154253105221 |
7 | 132252146230000 |
oct | 16451551743455 |
9 | 3483365570234 |
10 | 1002030221101 |
11 | 356a5aa34078 |
12 | 142249a88211 |
13 | 7364ca946c0 |
14 | 366d9d2b537 |
15 | 1b0e9ae8451 |
hex | e94da7c72d |
1002030221101 has 20 divisors (see below), whose sum is σ = 1258886179292. Its totient is φ = 792815095296.
The previous prime is 1002030221099. The next prime is 1002030221117. The reversal of 1002030221101 is 1011220302001.
It can be written as a sum of positive squares in 2 ways, for example, as 463963960201 + 538066260900 = 681149^2 + 733530^2 .
It is not a de Polignac number, because 1002030221101 - 21 = 1002030221099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002030221191) 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 19 ways as a sum of consecutive naturals, for example, 16020276 + ... + 16082701.
Almost surely, 21002030221101 is an apocalyptic number.
It is an amenable number.
1002030221101 is a deficient number, since it is larger than the sum of its proper divisors (256855958191).
1002030221101 is an frugal number, since it uses more digits than its factorization.
1002030221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32103018 (or 32102997 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1002030221101 its reverse (1011220302001), we get a palindrome (2013250523102).
The spelling of 1002030221101 in words is "one trillion, two billion, thirty million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •