Base | Representation |
---|---|
bin | 10010010001010010111… |
… | …001000001110111110101 |
3 | 11110000201102111211220110 |
4 | 102101102321001313311 |
5 | 131032301402211041 |
6 | 2400440051053233 |
7 | 156464661352422 |
oct | 22212271016765 |
9 | 4400642454813 |
10 | 1255521132021 |
11 | 444510a47372 |
12 | 1833b35a1219 |
13 | 9151a159b50 |
14 | 44aa6212d49 |
15 | 229d4126516 |
hex | 12452e41df5 |
1255521132021 has 8 divisors (see below), whose sum is σ = 1802799574240. Its totient is φ = 772628388912.
The previous prime is 1255521132017. The next prime is 1255521132059. The reversal of 1255521132021 is 1202311255521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1255521132021 - 22 = 1255521132017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1255521132021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1255521132011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16096424731 + ... + 16096424808.
It is an arithmetic number, because the mean of its divisors is an integer number (225349946780).
Almost surely, 21255521132021 is an apocalyptic number.
It is an amenable number.
1255521132021 is a deficient number, since it is larger than the sum of its proper divisors (547278442219).
1255521132021 is a wasteful number, since it uses less digits than its factorization.
1255521132021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32192849555.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 1255521132021 its reverse (1202311255521), we get a palindrome (2457832387542).
The spelling of 1255521132021 in words is "one trillion, two hundred fifty-five billion, five hundred twenty-one million, one hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •