Base | Representation |
---|---|
bin | 10100100101011000100… |
… | …100100110111011111111 |
3 | 12000020011001012001200221 |
4 | 110211120210212323333 |
5 | 141133424214411223 |
6 | 3001454244002211 |
7 | 204124243405444 |
oct | 24453044467377 |
9 | 5006131161627 |
10 | 1414530232063 |
11 | 4a5998491743 |
12 | 1aa18b390367 |
13 | a350b024620 |
14 | 4c66c2a79cb |
15 | 26bddacdb5d |
hex | 14958926eff |
1414530232063 has 8 divisors (see below), whose sum is σ = 1528961435456. Its totient is φ = 1300902055200.
The previous prime is 1414530231977. The next prime is 1414530232067. The reversal of 1414530232063 is 3602320354141.
It is a happy number.
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 1414530232063 - 225 = 1414496677631 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414530232067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200752968 + ... + 200760013.
It is an arithmetic number, because the mean of its divisors is an integer number (191120179432).
Almost surely, 21414530232063 is an apocalyptic number.
1414530232063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1414530232063 is a deficient number, since it is larger than the sum of its proper divisors (114431203393).
1414530232063 is a wasteful number, since it uses less digits than its factorization.
1414530232063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401513265.
The product of its (nonzero) digits is 51840, while the sum is 34.
The spelling of 1414530232063 in words is "one trillion, four hundred fourteen billion, five hundred thirty million, two hundred thirty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •