Base | Representation |
---|---|
bin | 1001000110101110101000… |
… | …0010100001100110011111 |
3 | 1022110001122202121222100201 |
4 | 2101223222002201212133 |
5 | 2303010414241031033 |
6 | 33143025411004331 |
7 | 2052166606521115 |
oct | 221535202414637 |
9 | 38401582558321 |
10 | 10011200330143 |
11 | 320a7a965a911 |
12 | 11582a28996a7 |
13 | 57808a7244cc |
14 | 26878a869ab5 |
15 | 1256333a447d |
hex | 91aea0a199f |
10011200330143 has 4 divisors (see below), whose sum is σ = 10017688471888. Its totient is φ = 10004712188400.
The previous prime is 10011200330141. The next prime is 10011200330171. The reversal of 10011200330143 is 34103300211001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10011200330143 - 21 = 10011200330141 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 10011200330143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011200330141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3244068558 + ... + 3244071643.
It is an arithmetic number, because the mean of its divisors is an integer number (2504422117972).
Almost surely, 210011200330143 is an apocalyptic number.
10011200330143 is a deficient number, since it is larger than the sum of its proper divisors (6488141745).
10011200330143 is an equidigital number, since it uses as much as digits as its factorization.
10011200330143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6488141744.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10011200330143 its reverse (34103300211001), we get a palindrome (44114500541144).
The spelling of 10011200330143 in words is "ten trillion, eleven billion, two hundred million, three hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •