Base | Representation |
---|---|
bin | 1010000010000001111101… |
… | …0011111010111110100101 |
3 | 1110001110100202110021000210 |
4 | 2200200133103322332211 |
5 | 2421203420320112013 |
6 | 35243040200130033 |
7 | 2215614500251050 |
oct | 240403723727645 |
9 | 43043322407023 |
10 | 11030001332133 |
11 | 3572885222883 |
12 | 12a1831166919 |
13 | 620180b645a4 |
14 | 2a1bd7c49a97 |
15 | 141db0497cc3 |
hex | a081f4fafa5 |
11030001332133 has 16 divisors (see below), whose sum is σ = 17020375777280. Its totient is φ = 6223074891696.
The previous prime is 11030001332111. The next prime is 11030001332143. The reversal of 11030001332133 is 33123310003011.
It is not a de Polignac number, because 11030001332133 - 217 = 11030001201061 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030001332143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3324290485 + ... + 3324293802.
It is an arithmetic number, because the mean of its divisors is an integer number (1063773486080).
Almost surely, 211030001332133 is an apocalyptic number.
It is an amenable number.
11030001332133 is a deficient number, since it is larger than the sum of its proper divisors (5990374445147).
11030001332133 is an equidigital number, since it uses as much as digits as its factorization.
11030001332133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6648584376.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11030001332133 its reverse (33123310003011), we get a palindrome (44153311335144).
The spelling of 11030001332133 in words is "eleven trillion, thirty billion, one million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •