Base | Representation |
---|---|
bin | 10101010010100110… |
… | …10000101011001101 |
3 | 1002111121012002022121 |
4 | 22221103100223031 |
5 | 141402131130013 |
6 | 5130115412541 |
7 | 553153141252 |
oct | 125123205315 |
9 | 32447162277 |
10 | 11430333133 |
11 | 493614150a |
12 | 226bbb4151 |
13 | 110212973b |
14 | 7a60cd429 |
15 | 46d74558d |
hex | 2a94d0acd |
11430333133 has 4 divisors (see below), whose sum is σ = 11709121788. Its totient is φ = 11151544480.
The previous prime is 11430333071. The next prime is 11430333137. The reversal of 11430333133 is 33133303411.
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 230979204 + 11199353929 = 15198^2 + 105827^2 .
It is a cyclic number.
It is not a de Polignac number, because 11430333133 - 221 = 11428235981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11430333098 and 11430333107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11430333137) 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, 139394266 + ... + 139394347.
It is an arithmetic number, because the mean of its divisors is an integer number (2927280447).
Almost surely, 211430333133 is an apocalyptic number.
It is an amenable number.
11430333133 is a deficient number, since it is larger than the sum of its proper divisors (278788655).
11430333133 is an equidigital number, since it uses as much as digits as its factorization.
11430333133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278788654.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 11430333133 its reverse (33133303411), we get a palindrome (44563636544).
The spelling of 11430333133 in words is "eleven billion, four hundred thirty million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •