Base | Representation |
---|---|
bin | 1010001100001010101001… |
… | …1111100010001111110110 |
3 | 1110200002211102212021120122 |
4 | 2203002222133202033312 |
5 | 2432032032041221210 |
6 | 35455035243131542 |
7 | 2234320625002535 |
oct | 243025237421766 |
9 | 43602742767518 |
10 | 11204135101430 |
11 | 362a7131a0007 |
12 | 130b52a213bb2 |
13 | 6337123483bb |
14 | 2aa3d68d831c |
15 | 1466a2b8db55 |
hex | a30aa7e23f6 |
11204135101430 has 8 divisors (see below), whose sum is σ = 20167443182592. Its totient is φ = 4481654040568.
The previous prime is 11204135101421. The next prime is 11204135101487. The reversal of 11204135101430 is 3410153140211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11204135101430.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 560206755062 + ... + 560206755081.
It is an arithmetic number, because the mean of its divisors is an integer number (2520930397824).
Almost surely, 211204135101430 is an apocalyptic number.
11204135101430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11204135101430 is a deficient number, since it is larger than the sum of its proper divisors (8963308081162).
11204135101430 is a wasteful number, since it uses less digits than its factorization.
11204135101430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120413510150.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 11204135101430 its reverse (3410153140211), we get a palindrome (14614288241641).
The spelling of 11204135101430 in words is "eleven trillion, two hundred four billion, one hundred thirty-five million, one hundred one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •