Base | Representation |
---|---|
bin | 10011000111010000000000… |
… | …00100000110110110101111 |
3 | 12111211002012100221020222220 |
4 | 21203220000010012312233 |
5 | 21002112032031112221 |
6 | 225220322452010423 |
7 | 11565415144053426 |
oct | 1143500004066657 |
9 | 174732170836886 |
10 | 42030551035311 |
11 | 12435069363973 |
12 | 4869976600a13 |
13 | 1a5b605407707 |
14 | a5440a6522bd |
15 | 4cd49edbd0c6 |
hex | 263a00106daf |
42030551035311 has 4 divisors (see below), whose sum is σ = 56040734713752. Its totient is φ = 28020367356872.
The previous prime is 42030551035309. The next prime is 42030551035463. The reversal of 42030551035311 is 11353015503024.
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 42030551035311 - 21 = 42030551035309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42030551025311) 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 3 ways as a sum of consecutive naturals, for example, 7005091839216 + ... + 7005091839221.
It is an arithmetic number, because the mean of its divisors is an integer number (14010183678438).
Almost surely, 242030551035311 is an apocalyptic number.
42030551035311 is a deficient number, since it is larger than the sum of its proper divisors (14010183678441).
42030551035311 is a wasteful number, since it uses less digits than its factorization.
42030551035311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14010183678440.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 42030551035311 its reverse (11353015503024), we get a palindrome (53383566538335).
The spelling of 42030551035311 in words is "forty-two trillion, thirty billion, five hundred fifty-one million, thirty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •