Base | Representation |
---|---|
bin | 10101010010111010… |
… | …11110010010011011 |
3 | 1002111210020002202002 |
4 | 22221131132102123 |
5 | 141403322312311 |
6 | 5130253031215 |
7 | 553214661431 |
oct | 125135362233 |
9 | 32453202662 |
10 | 11433010331 |
11 | 49376aa976 |
12 | 2270a8550b |
13 | 1102856192 |
14 | 7a65c8d51 |
15 | 46dac393b |
hex | 2a975e49b |
11433010331 has 4 divisors (see below), whose sum is σ = 11433683664. Its totient is φ = 11432337000.
The previous prime is 11433010321. The next prime is 11433010367. The reversal of 11433010331 is 13301033411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13301033411 = 373 ⋅35659607.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11433010331 is a prime.
It is a super-2 number, since 2×114330103312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11433010321) 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 3 ways as a sum of consecutive naturals, for example, 310520 + ... + 345381.
It is an arithmetic number, because the mean of its divisors is an integer number (2858420916).
Almost surely, 211433010331 is an apocalyptic number.
11433010331 is a deficient number, since it is larger than the sum of its proper divisors (673333).
11433010331 is an equidigital number, since it uses as much as digits as its factorization.
11433010331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673332.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11433010331 its reverse (13301033411), we get a palindrome (24734043742).
The spelling of 11433010331 in words is "eleven billion, four hundred thirty-three million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •