Base | Representation |
---|---|
bin | 10101010000011101… |
… | …00110001101111001 |
3 | 1002110100022121101001 |
4 | 22220032212031321 |
5 | 141333024132213 |
6 | 5124233525001 |
7 | 552544143064 |
oct | 125016461571 |
9 | 32410277331 |
10 | 11412333433 |
11 | 4926a68026 |
12 | 2265b73761 |
13 | 10cb496927 |
14 | 7a39658db |
15 | 46bd8c1dd |
hex | 2a83a6379 |
11412333433 has 8 divisors (see below), whose sum is σ = 11442642560. Its totient is φ = 11382066000.
The previous prime is 11412333403. The next prime is 11412333469. The reversal of 11412333433 is 33433321411.
11412333433 is digitally balanced in base 2, 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 cyclic number.
It is not a de Polignac number, because 11412333433 - 213 = 11412325241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11412333403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 581383 + ... + 600691.
It is an arithmetic number, because the mean of its divisors is an integer number (1430330320).
Almost surely, 211412333433 is an apocalyptic number.
It is an amenable number.
11412333433 is a deficient number, since it is larger than the sum of its proper divisors (30309127).
11412333433 is an equidigital number, since it uses as much as digits as its factorization.
11412333433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20847.
The product of its digits is 7776, while the sum is 28.
Adding to 11412333433 its reverse (33433321411), we get a palindrome (44845654844).
The spelling of 11412333433 in words is "eleven billion, four hundred twelve million, three hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •