Base | Representation |
---|---|
bin | 1010010001110000001010… |
… | …0100010000000100100111 |
3 | 1111000021112112112111220001 |
4 | 2210130002210100010213 |
5 | 2440120102103410343 |
6 | 40011110055122131 |
7 | 2244256030204432 |
oct | 244340244200447 |
9 | 44007475474801 |
10 | 11300102013223 |
11 | 3667389aa2261 |
12 | 1326051373347 |
13 | 63c79741c8ca |
14 | 2b0cdc070819 |
15 | 148e1ccb944d |
hex | a4702910127 |
11300102013223 has 8 divisors (see below), whose sum is σ = 11617982942400. Its totient is φ = 10985448301920.
The previous prime is 11300102013127. The next prime is 11300102013257. The reversal of 11300102013223 is 32231020100311.
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 11300102013223 - 221 = 11300099916071 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11300102013223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11300102013293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 806797368 + ... + 806811373.
It is an arithmetic number, because the mean of its divisors is an integer number (1452247867800).
Almost surely, 211300102013223 is an apocalyptic number.
11300102013223 is a deficient number, since it is larger than the sum of its proper divisors (317880929177).
11300102013223 is a wasteful number, since it uses less digits than its factorization.
11300102013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1613608937.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11300102013223 its reverse (32231020100311), we get a palindrome (43531122113534).
The spelling of 11300102013223 in words is "eleven trillion, three hundred billion, one hundred two million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •