Base | Representation |
---|---|
bin | 11110010101010010011101… |
… | …111100010010101111111111 |
3 | 122111100022220102010002021221 |
4 | 132111102131330102233333 |
5 | 114441144034003321421 |
6 | 1151421034403134211 |
7 | 40046100521465056 |
oct | 3625223574225777 |
9 | 574308812102257 |
10 | 133404334042111 |
11 | 395635077a5290 |
12 | 12b667a1674367 |
13 | 5958c89601682 |
14 | 24d2b38ac339d |
15 | 1065245e41841 |
hex | 79549df12bff |
133404334042111 has 16 divisors (see below), whose sum is σ = 154585015735968. Its totient is φ = 113778072345600.
The previous prime is 133404334042073. The next prime is 133404334042117. The reversal of 133404334042111 is 111240433404331.
It is a cyclic number.
It is not a de Polignac number, because 133404334042111 - 239 = 132854578228223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133404334042117) 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, 1139545560 + ... + 1139662621.
It is an arithmetic number, because the mean of its divisors is an integer number (9661563483498).
Almost surely, 2133404334042111 is an apocalyptic number.
133404334042111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133404334042111 is a deficient number, since it is larger than the sum of its proper divisors (21180681693857).
133404334042111 is a wasteful number, since it uses less digits than its factorization.
133404334042111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2279208522.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 133404334042111 its reverse (111240433404331), we get a palindrome (244644767446442).
The spelling of 133404334042111 in words is "one hundred thirty-three trillion, four hundred four billion, three hundred thirty-four million, forty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •