Base | Representation |
---|---|
bin | 111101111111010100… |
… | …0011100010001110101 |
3 | 110201121102201011110222 |
4 | 1323332220130101311 |
5 | 4140112441031313 |
6 | 141053245424125 |
7 | 12421602053621 |
oct | 1737650342165 |
9 | 421542634428 |
10 | 133121033333 |
11 | 51502397722 |
12 | 21971b6b045 |
13 | c726685412 |
14 | 662bbba181 |
15 | 36e1d64208 |
hex | 1efea1c475 |
133121033333 has 4 divisors (see below), whose sum is σ = 134439063468. Its totient is φ = 131803003200.
The previous prime is 133121033321. The next prime is 133121033341. The reversal of 133121033333 is 333330121331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 86978986084 + 46142047249 = 294922^2 + 214807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133121033333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133121003333) 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, 659014916 + ... + 659015117.
It is an arithmetic number, because the mean of its divisors is an integer number (33609765867).
Almost surely, 2133121033333 is an apocalyptic number.
It is an amenable number.
133121033333 is a deficient number, since it is larger than the sum of its proper divisors (1318030135).
133121033333 is a wasteful number, since it uses less digits than its factorization.
133121033333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1318030134.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 133121033333 its reverse (333330121331), we get a palindrome (466451154664).
The spelling of 133121033333 in words is "one hundred thirty-three billion, one hundred twenty-one million, thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •