Base | Representation |
---|---|
bin | 111101111100000000… |
… | …1010011011010010101 |
3 | 110201022200222200102010 |
4 | 1323320001103122111 |
5 | 4134401042010401 |
6 | 141034244134433 |
7 | 12416054165361 |
oct | 1737001233225 |
9 | 421280880363 |
10 | 133010110101 |
11 | 51455815430 |
12 | 21940997419 |
13 | c7096b8a7b |
14 | 661b1842a1 |
15 | 36d7252ed6 |
hex | 1ef8053695 |
133010110101 has 32 divisors (see below), whose sum is σ = 196826112000. Its totient is φ = 79223676800.
The previous prime is 133010110097. The next prime is 133010110111. The reversal of 133010110101 is 101011010331.
It is a cyclic number.
It is not a de Polignac number, because 133010110101 - 22 = 133010110097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133010110111) 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 31 ways as a sum of consecutive naturals, for example, 396025 + ... + 650273.
It is an arithmetic number, because the mean of its divisors is an integer number (6150816000).
Almost surely, 2133010110101 is an apocalyptic number.
133010110101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133010110101 is a deficient number, since it is larger than the sum of its proper divisors (63816001899).
133010110101 is a wasteful number, since it uses less digits than its factorization.
133010110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254537.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 133010110101 its reverse (101011010331), we get a palindrome (234021120432).
The spelling of 133010110101 in words is "one hundred thirty-three billion, ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •