Base | Representation |
---|---|
bin | 11101101110011010011… |
… | …11000101000010000001 |
3 | 10121122021200012210020220 |
4 | 32313031033011002001 |
5 | 113213211213444301 |
6 | 2101111342253253 |
7 | 133535006162460 |
oct | 16671517050201 |
9 | 3548250183226 |
10 | 1021350531201 |
11 | 364174826000 |
12 | 145b40287229 |
13 | 7540b6c1560 |
14 | 3760dc449d7 |
15 | 1b87ad54936 |
hex | edcd3c5081 |
1021350531201 has 64 divisors (see below), whose sum is σ = 1843543382016. Its totient is φ = 489758322240.
The previous prime is 1021350531181. The next prime is 1021350531217.
1021350531201 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1021350531201 - 210 = 1021350530177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1021350531101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1042051 + ... + 1768776.
It is an arithmetic number, because the mean of its divisors is an integer number (28805365344).
Almost surely, 21021350531201 is an apocalyptic number.
1021350531201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1021350531201 is a deficient number, since it is larger than the sum of its proper divisors (822192850815).
1021350531201 is a wasteful number, since it uses less digits than its factorization.
1021350531201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2810883 (or 2810861 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
It can be divided in two parts, 1021350 and 531201, that added together give a palindrome (1552551).
The spelling of 1021350531201 in words is "one trillion, twenty-one billion, three hundred fifty million, five hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •