Base | Representation |
---|---|
bin | 11110001111100011010011… |
… | …110100100101111110010011 |
3 | 122102221122022122002122012222 |
4 | 132033203103310211332103 |
5 | 114413214141324032011 |
6 | 1150515555153011255 |
7 | 40005443204105423 |
oct | 3617432364457623 |
9 | 572848278078188 |
10 | 133010101002131 |
11 | 394212a34a4351 |
12 | 12b022b9853b2b |
13 | 592aa4c9a7212 |
14 | 24bba1a7ca483 |
15 | 1059d7099bddb |
hex | 78f8d3d25f93 |
133010101002131 has 4 divisors (see below), whose sum is σ = 133030075494600. Its totient is φ = 132990126509664.
The previous prime is 133010101002083. The next prime is 133010101002133. The reversal of 133010101002131 is 131200101010331.
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 133010101002131 - 238 = 132735223095187 is a prime.
It is a super-2 number, since 2×1330101010021312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133010101002133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9987236246 + ... + 9987249563.
It is an arithmetic number, because the mean of its divisors is an integer number (33257518873650).
Almost surely, 2133010101002131 is an apocalyptic number.
133010101002131 is a deficient number, since it is larger than the sum of its proper divisors (19974492469).
133010101002131 is an equidigital number, since it uses as much as digits as its factorization.
133010101002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19974492468.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 133010101002131 its reverse (131200101010331), we get a palindrome (264210202012462).
The spelling of 133010101002131 in words is "one hundred thirty-three trillion, ten billion, one hundred one million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •