Base | Representation |
---|---|
bin | 1010000000011010111101… |
… | …0110000001001101111101 |
3 | 1102221210222220021222200011 |
4 | 2200012233112001031331 |
5 | 2420230304333430023 |
6 | 35222224453103221 |
7 | 2213615364462202 |
oct | 240065726011575 |
9 | 42853886258604 |
10 | 11002353030013 |
11 | 3562087500214 |
12 | 12983b5927b11 |
13 | 61a695a757c7 |
14 | 2a0733c89ca9 |
15 | 1412e305350d |
hex | a01af58137d |
11002353030013 has 2 divisors, whose sum is σ = 11002353030014. Its totient is φ = 11002353030012.
The previous prime is 11002353029981. The next prime is 11002353030041. The reversal of 11002353030013 is 31003035320011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8062544449444 + 2939808580569 = 2839462^2 + 1714587^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002353030013 - 25 = 11002353029981 is a prime.
It is a super-4 number, since 4×110023530300134 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002353031013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501176515006 + 5501176515007.
It is an arithmetic number, because the mean of its divisors is an integer number (5501176515007).
Almost surely, 211002353030013 is an apocalyptic number.
It is an amenable number.
11002353030013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002353030013 is an equidigital number, since it uses as much as digits as its factorization.
11002353030013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 22.
Adding to 11002353030013 its reverse (31003035320011), we get a palindrome (42005388350024).
The spelling of 11002353030013 in words is "eleven trillion, two billion, three hundred fifty-three million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •