Base | Representation |
---|---|
bin | 11101101100001001000… |
… | …11111001100000011011 |
3 | 10121112010200220222222021 |
4 | 32312010203321200123 |
5 | 113203212100033001 |
6 | 2100350345035311 |
7 | 133462542400366 |
oct | 16660443714033 |
9 | 3545120828867 |
10 | 1020131252251 |
11 | 3636a9551751 |
12 | 14585ba85b37 |
13 | 75275c09c17 |
14 | 37535d370dd |
15 | 1b808cabba1 |
hex | ed848f981b |
1020131252251 has 4 divisors (see below), whose sum is σ = 1020379403104. Its totient is φ = 1019883101400.
The previous prime is 1020131252243. The next prime is 1020131252263. The reversal of 1020131252251 is 1522521310201.
It is a happy number.
1020131252251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1020131252251 - 23 = 1020131252243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020131252351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 124069260 + ... + 124077481.
It is an arithmetic number, because the mean of its divisors is an integer number (255094850776).
Almost surely, 21020131252251 is an apocalyptic number.
1020131252251 is a deficient number, since it is larger than the sum of its proper divisors (248150853).
1020131252251 is an equidigital number, since it uses as much as digits as its factorization.
1020131252251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 248150852.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 1020131252251 its reverse (1522521310201), we get a palindrome (2542652562452).
The spelling of 1020131252251 in words is "one trillion, twenty billion, one hundred thirty-one million, two hundred fifty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •