Base | Representation |
---|---|
bin | 11101011010000001011… |
… | …10011000001100100001 |
3 | 10120121000201220110101110 |
4 | 32231000232120030201 |
5 | 113023301210322423 |
6 | 2052101155253533 |
7 | 132666506420226 |
oct | 16550056301441 |
9 | 3517021813343 |
10 | 1010403214113 |
11 | 35a567300707 |
12 | 1439a5baa2a9 |
13 | 74385681537 |
14 | 36c91d6994d |
15 | 1b439c20193 |
hex | eb40b98321 |
1010403214113 has 8 divisors (see below), whose sum is σ = 1347262206048. Its totient is φ = 673573182464.
The previous prime is 1010403214109. The next prime is 1010403214159. The reversal of 1010403214113 is 3114123040101.
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 1010403214113 - 22 = 1010403214109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010403214113.
It is not an unprimeable number, because it can be changed into a prime (1010403214103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7158531 + ... + 7298312.
It is an arithmetic number, because the mean of its divisors is an integer number (168407775756).
Almost surely, 21010403214113 is an apocalyptic number.
It is an amenable number.
1010403214113 is a deficient number, since it is larger than the sum of its proper divisors (336858991935).
1010403214113 is a wasteful number, since it uses less digits than its factorization.
1010403214113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14480143.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1010403214113 its reverse (3114123040101), we get a palindrome (4124526254214).
The spelling of 1010403214113 in words is "one trillion, ten billion, four hundred three million, two hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •