Base | Representation |
---|---|
bin | 111101111100010011… |
… | …1000010101011000100 |
3 | 110201100101121021221020 |
4 | 1323320213002223010 |
5 | 4134411110044022 |
6 | 141035240151140 |
7 | 12416234240601 |
oct | 1737047025304 |
9 | 421311537836 |
10 | 133020003012 |
11 | 51460362096 |
12 | 219441684b0 |
13 | c70b770970 |
14 | 661c5db6a8 |
15 | 36d805935c |
hex | 1ef89c2ac4 |
133020003012 has 48 divisors (see below), whose sum is σ = 335202430080. Its totient is φ = 40813267968.
The previous prime is 133020002971. The next prime is 133020003013. The reversal of 133020003012 is 210300020331.
It is a junction number, because it is equal to n+sod(n) for n = 133020002982 and 133020003000.
It is not an unprimeable number, because it can be changed into a prime (133020003013) 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 15 ways as a sum of consecutive naturals, for example, 1152712 + ... + 1262847.
It is an arithmetic number, because the mean of its divisors is an integer number (6983383960).
Almost surely, 2133020003012 is an apocalyptic number.
133020003012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133020003012 is an abundant number, since it is smaller than the sum of its proper divisors (202182427068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133020003012 is a wasteful number, since it uses less digits than its factorization.
133020003012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2415932 (or 2415930 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 133020003012 its reverse (210300020331), we get a palindrome (343320023343).
The spelling of 133020003012 in words is "one hundred thirty-three billion, twenty million, three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •