Base | Representation |
---|---|
bin | 10001011110101101000… |
… | …110011011111000011101 |
3 | 11020211111200202111100110 |
4 | 101132231012123320131 |
5 | 124140024201133041 |
6 | 2315453525120233 |
7 | 152532566466420 |
oct | 21365506337035 |
9 | 4224450674313 |
10 | 1201200021021 |
11 | 423476107700 |
12 | 174973559079 |
13 | 893710b8910 |
14 | 421d1a619b7 |
15 | 213a522c516 |
hex | 117ad19be1d |
1201200021021 has 96 divisors (see below), whose sum is σ = 2225252425984. Its totient is φ = 560431872000.
The previous prime is 1201200020959. The next prime is 1201200021023.
1201200021021 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1201200021021 - 27 = 1201200020893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201200020988 and 1201200021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201200021023) 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 95 ways as a sum of consecutive naturals, for example, 730821 + ... + 1713621.
Almost surely, 21201200021021 is an apocalyptic number.
1201200021021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1201200021021 is a deficient number, since it is larger than the sum of its proper divisors (1024052404963).
1201200021021 is a wasteful number, since it uses less digits than its factorization.
1201200021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982883 (or 982872 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 12012000 and 21021, that added together give a palindrome (12033021).
The spelling of 1201200021021 in words is "one trillion, two hundred one billion, two hundred million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •