Base | Representation |
---|---|
bin | 1010000010000011000100… |
… | …1111101011100001010101 |
3 | 1110001111010201121110001102 |
4 | 2200200301033223201111 |
5 | 2421210024331211013 |
6 | 35243130105035445 |
7 | 2215625112545303 |
oct | 240406117534125 |
9 | 43044121543042 |
10 | 11030302210133 |
11 | 3572a1a046988 |
12 | 12a18b5a85b85 |
13 | 6201cb2abbcb |
14 | 2a1c25bab273 |
15 | 141dcbacbd58 |
hex | a08313eb855 |
11030302210133 has 8 divisors (see below), whose sum is σ = 11198862611328. Its totient is φ = 10862590980384.
The previous prime is 11030302210129. The next prime is 11030302210163. The reversal of 11030302210133 is 33101220303011.
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 11030302210133 - 22 = 11030302210129 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 (11030302210163) 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 7 ways as a sum of consecutive naturals, for example, 212266685 + ... + 212318642.
It is an arithmetic number, because the mean of its divisors is an integer number (1399857826416).
Almost surely, 211030302210133 is an apocalyptic number.
It is an amenable number.
11030302210133 is a deficient number, since it is larger than the sum of its proper divisors (168560401195).
11030302210133 is an equidigital number, since it uses as much as digits as its factorization.
11030302210133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424585723.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11030302210133 its reverse (33101220303011), we get a palindrome (44131522513144).
The spelling of 11030302210133 in words is "eleven trillion, thirty billion, three hundred two million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •