Base | Representation |
---|---|
bin | 11101011101011011011… |
… | …10110011011010000010 |
3 | 10120202202012011112202212 |
4 | 32232231232303122002 |
5 | 113041022400321424 |
6 | 2053002445342122 |
7 | 133063024252256 |
oct | 16565556633202 |
9 | 3522665145685 |
10 | 1012232042114 |
11 | 360315665207 |
12 | 144216567942 |
13 | 745b7525c97 |
14 | 36dc6bc8266 |
15 | 1b4e557010e |
hex | ebadbb3682 |
1012232042114 has 8 divisors (see below), whose sum is σ = 1518436943100. Its totient is φ = 506086394416.
The previous prime is 1012232042053. The next prime is 1012232042119. The reversal of 1012232042114 is 4112402322101.
It can be written as a sum of positive squares in 2 ways, for example, as 1004254515625 + 7977526489 = 1002125^2 + 89317^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10122320421142 (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 1012232042114.
It is not an unprimeable number, because it can be changed into a prime (1012232042119) 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 3 ways as a sum of consecutive naturals, for example, 14770589 + ... + 14838960.
Almost surely, 21012232042114 is an apocalyptic number.
1012232042114 is a deficient number, since it is larger than the sum of its proper divisors (506204900986).
1012232042114 is a wasteful number, since it uses less digits than its factorization.
1012232042114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29626644.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1012232042114 its reverse (4112402322101), we get a palindrome (5124634364215).
The spelling of 1012232042114 in words is "one trillion, twelve billion, two hundred thirty-two million, forty-two thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •