Base | Representation |
---|---|
bin | 111110000101000001… |
… | …0000111001011011110 |
3 | 110202002202122010112011 |
4 | 1330022002013023132 |
5 | 4141010422441110 |
6 | 141124241301434 |
7 | 12426413645512 |
oct | 1741202071336 |
9 | 422082563464 |
10 | 133312312030 |
11 | 515a0363197 |
12 | 21a0603487a |
13 | c7571a7b91 |
14 | 664936c142 |
15 | 3703a4948a |
hex | 1f0a0872de |
133312312030 has 8 divisors (see below), whose sum is σ = 239962161672. Its totient is φ = 53324924808.
The previous prime is 133312312013. The next prime is 133312312039. The reversal of 133312312030 is 30213213331.
133312312030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 133312311992 and 133312312010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133312312039) 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, 6665615592 + ... + 6665615611.
It is an arithmetic number, because the mean of its divisors is an integer number (29995270209).
Almost surely, 2133312312030 is an apocalyptic number.
133312312030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133312312030 is a deficient number, since it is larger than the sum of its proper divisors (106649849642).
133312312030 is a wasteful number, since it uses less digits than its factorization.
133312312030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13331231210.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 133312312030 its reverse (30213213331), we get a palindrome (163525525361).
The spelling of 133312312030 in words is "one hundred thirty-three billion, three hundred twelve million, three hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •