Base | Representation |
---|---|
bin | 11101100000111011010… |
… | …10101001100001001111 |
3 | 10120221121001212202101020 |
4 | 32300131222221201033 |
5 | 113103344130014411 |
6 | 2053513052445223 |
7 | 133160406532605 |
oct | 16603552514117 |
9 | 3527531782336 |
10 | 1014110001231 |
11 | 361099726738 |
12 | 14465b479813 |
13 | 748266104b2 |
14 | 37124395875 |
15 | 1b5a5377606 |
hex | ec1daa984f |
1014110001231 has 8 divisors (see below), whose sum is σ = 1383591939840. Its totient is φ = 660350698392.
The previous prime is 1014110001221. The next prime is 1014110001253. The reversal of 1014110001231 is 1321000114101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1014110001231 - 26 = 1014110001167 is a prime.
It is a super-2 number, since 2×10141100012312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1014110001231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014110001221) 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, 3930658791 + ... + 3930659048.
It is an arithmetic number, because the mean of its divisors is an integer number (172948992480).
Almost surely, 21014110001231 is an apocalyptic number.
1014110001231 is a deficient number, since it is larger than the sum of its proper divisors (369481938609).
1014110001231 is an equidigital number, since it uses as much as digits as its factorization.
1014110001231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7861317885.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1014110001231 its reverse (1321000114101), we get a palindrome (2335110115332).
The spelling of 1014110001231 in words is "one trillion, fourteen billion, one hundred ten million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •