Base | Representation |
---|---|
bin | 1001001001101000001011… |
… | …11011101000101111100101 |
3 | 2122020122110021001212011101 |
4 | 10210310011323220233211 |
5 | 10114134344423114341 |
6 | 110443532354040101 |
7 | 4144524305664520 |
oct | 444640573505745 |
9 | 78218407055141 |
10 | 20122021301221 |
11 | 6458779498734 |
12 | 230b948279031 |
13 | b2c663192c18 |
14 | 4d7ca7c05bb7 |
15 | 24d64750a831 |
hex | 124d05ee8be5 |
20122021301221 has 8 divisors (see below), whose sum is σ = 22996741743360. Its totient is φ = 17247337351728.
The previous prime is 20122021301197. The next prime is 20122021301231. The reversal of 20122021301221 is 12210312022102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20122021301221 - 25 = 20122021301189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122021301231) 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 7 ways as a sum of consecutive naturals, for example, 7931206 + ... + 10156183.
It is an arithmetic number, because the mean of its divisors is an integer number (2874592717920).
Almost surely, 220122021301221 is an apocalyptic number.
It is an amenable number.
20122021301221 is a deficient number, since it is larger than the sum of its proper divisors (2874720442139).
20122021301221 is a wasteful number, since it uses less digits than its factorization.
20122021301221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18246323.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 20122021301221 its reverse (12210312022102), we get a palindrome (32332333323323).
The spelling of 20122021301221 in words is "twenty trillion, one hundred twenty-two billion, twenty-one million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •