Base | Representation |
---|---|
bin | 1001010010000000110101… |
… | …01000011111000111101001 |
3 | 2200021012010011001220101001 |
4 | 10221000122220133013221 |
5 | 10133344422120131213 |
6 | 111224141313355001 |
7 | 4204404040344361 |
oct | 451003250370751 |
9 | 80235104056331 |
10 | 20410131411433 |
11 | 65599850aa835 |
12 | 2357753868a61 |
13 | b5088990058a |
14 | 507bd9bcd9a1 |
15 | 255daae491dd |
hex | 12901aa1f1e9 |
20410131411433 has 16 divisors (see below), whose sum is σ = 22226972428800. Its totient is φ = 18667659790080.
The previous prime is 20410131411421. The next prime is 20410131411451. The reversal of 20410131411433 is 33411413101402.
It is a cyclic number.
It is not a de Polignac number, because 20410131411433 - 237 = 20272692457961 is a prime.
It is a super-3 number, since 3×204101314114333 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20410131411403) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5413185 + ... + 8373937.
It is an arithmetic number, because the mean of its divisors is an integer number (1389185776800).
Almost surely, 220410131411433 is an apocalyptic number.
It is an amenable number.
20410131411433 is a deficient number, since it is larger than the sum of its proper divisors (1816841017367).
20410131411433 is a wasteful number, since it uses less digits than its factorization.
20410131411433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2973312.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 20410131411433 its reverse (33411413101402), we get a palindrome (53821544512835).
The spelling of 20410131411433 in words is "twenty trillion, four hundred ten billion, one hundred thirty-one million, four hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •