Base | Representation |
---|---|
bin | 11101100001000111011… |
… | …01011101001000010100 |
3 | 10120221212010200100122001 |
4 | 32300203231131020110 |
5 | 113104101104301322 |
6 | 2053531114045044 |
7 | 133163050442503 |
oct | 16604355351024 |
9 | 3527763610561 |
10 | 1014211400212 |
11 | 36114099324a |
12 | 144689419784 |
13 | 748416239aa |
14 | 37133a2c83a |
15 | 1b5ae206827 |
hex | ec23b5d214 |
1014211400212 has 6 divisors (see below), whose sum is σ = 1774869950378. Its totient is φ = 507105700104.
The previous prime is 1014211400173. The next prime is 1014211400249. The reversal of 1014211400212 is 2120041124101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 797813385616 + 216398014596 = 893204^2 + 465186^2 .
It is a super-3 number, since 3×10142114002123 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1014211400212.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126776425023 + ... + 126776425030.
Almost surely, 21014211400212 is an apocalyptic number.
It is an amenable number.
1014211400212 is a deficient number, since it is larger than the sum of its proper divisors (760658550166).
1014211400212 is a wasteful number, since it uses less digits than its factorization.
1014211400212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253552850057 (or 253552850055 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 1014211400212 its reverse (2120041124101), we get a palindrome (3134252524313).
The spelling of 1014211400212 in words is "one trillion, fourteen billion, two hundred eleven million, four hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •