Base | Representation |
---|---|
bin | 11110001111110010011111… |
… | …011100011001001000010101 |
3 | 122110000012101200111211010201 |
4 | 132033302133130121020111 |
5 | 114414001032420041041 |
6 | 1150531252510220501 |
7 | 40006561153210225 |
oct | 3617623734311025 |
9 | 573005350454121 |
10 | 133026402112021 |
11 | 394281a90014a0 |
12 | 12b054a8ab4731 |
13 | 592c449c59482 |
14 | 24bc725740085 |
15 | 105a4c6b20631 |
hex | 78fc9f719215 |
133026402112021 has 64 divisors (see below), whose sum is σ = 149476927721472. Its totient is φ = 117364464000000.
The previous prime is 133026402112001. The next prime is 133026402112091. The reversal of 133026402112021 is 120211204620331.
It is a cyclic number.
It is not a de Polignac number, because 133026402112021 - 215 = 133026402079253 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 (133026402112001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29127740680 + ... + 29127745246.
It is an arithmetic number, because the mean of its divisors is an integer number (2335576995648).
Almost surely, 2133026402112021 is an apocalyptic number.
133026402112021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133026402112021 is a deficient number, since it is larger than the sum of its proper divisors (16450525609451).
133026402112021 is a wasteful number, since it uses less digits than its factorization.
133026402112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6194.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 133026402112021 its reverse (120211204620331), we get a palindrome (253237606732352).
The spelling of 133026402112021 in words is "one hundred thirty-three trillion, twenty-six billion, four hundred two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •