Base | Representation |
---|---|
bin | 11101101100001001000… |
… | …11111010010010010101 |
3 | 10121112010200221011100120 |
4 | 32312010203322102111 |
5 | 113203212100133240 |
6 | 2100350345102153 |
7 | 133462542412611 |
oct | 16660443722225 |
9 | 3545120834316 |
10 | 1020131255445 |
11 | 3636a9554095 |
12 | 14585ba87959 |
13 | 75275c0b503 |
14 | 37535d38341 |
15 | 1b808cacad0 |
hex | ed848fa495 |
1020131255445 has 8 divisors (see below), whose sum is σ = 1632210008736. Its totient is φ = 544070002896.
The previous prime is 1020131255417. The next prime is 1020131255477. The reversal of 1020131255445 is 5445521310201.
1020131255445 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020131255445 - 28 = 1020131255189 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34004375167 + ... + 34004375196.
It is an arithmetic number, because the mean of its divisors is an integer number (204026251092).
Almost surely, 21020131255445 is an apocalyptic number.
1020131255445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1020131255445 is a deficient number, since it is larger than the sum of its proper divisors (612078753291).
1020131255445 is an equidigital number, since it uses as much as digits as its factorization.
1020131255445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68008750371.
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 1020131255445 its reverse (5445521310201), we get a palindrome (6465652565646).
The spelling of 1020131255445 in words is "one trillion, twenty billion, one hundred thirty-one million, two hundred fifty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •