Base | Representation |
---|---|
bin | 111101111100000000… |
… | …0111000100101100111 |
3 | 110201022200210002200212 |
4 | 1323320000320211213 |
5 | 4134401030001411 |
6 | 141034241530035 |
7 | 12416053230143 |
oct | 1737000704547 |
9 | 421280702625 |
10 | 133010000231 |
11 | 5145574a929 |
12 | 2194094391b |
13 | c70967aa64 |
14 | 661b156223 |
15 | 36d723068b |
hex | 1ef8038967 |
133010000231 has 8 divisors (see below), whose sum is σ = 135100627200. Its totient is φ = 130929547320.
The previous prime is 133010000191. The next prime is 133010000243. The reversal of 133010000231 is 132000010331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133010000231 - 234 = 115830131047 is a prime.
It is a super-2 number, since 2×1330100002312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133010000261) 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 7 ways as a sum of consecutive naturals, for example, 2517161 + ... + 2569458.
It is an arithmetic number, because the mean of its divisors is an integer number (16887578400).
Almost surely, 2133010000231 is an apocalyptic number.
133010000231 is a deficient number, since it is larger than the sum of its proper divisors (2090626969).
133010000231 is an equidigital number, since it uses as much as digits as its factorization.
133010000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5087029.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 133010000231 its reverse (132000010331), we get a palindrome (265010010562).
The spelling of 133010000231 in words is "one hundred thirty-three billion, ten million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •