Base | Representation |
---|---|
bin | 11101100001000111011… |
… | …00110110010000101001 |
3 | 10120221212010101021020100 |
4 | 32300203230312100221 |
5 | 113104101034203001 |
6 | 2053531110420013 |
7 | 133163046210360 |
oct | 16604354662051 |
9 | 3527763337210 |
10 | 1014211241001 |
11 | 361140894672 |
12 | 144689361609 |
13 | 7484159939a |
14 | 371339ca7d7 |
15 | 1b5ae1c4586 |
hex | ec23b36429 |
1014211241001 has 12 divisors (see below), whose sum is σ = 1674253477312. Its totient is φ = 579549280536.
The previous prime is 1014211240997. The next prime is 1014211241011. The reversal of 1014211241001 is 1001421124101.
1014211241001 is a `hidden beast` number, since 1 + 0 + 1 + 421 + 1 + 241 + 0 + 0 + 1 = 666.
It is not a de Polignac number, because 1014211241001 - 22 = 1014211240997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1014211241011) by changing a digit.
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 in 11 ways as a sum of consecutive naturals, for example, 8049295501 + ... + 8049295626.
Almost surely, 21014211241001 is an apocalyptic number.
It is an amenable number.
1014211241001 is a deficient number, since it is larger than the sum of its proper divisors (660042236311).
1014211241001 is a wasteful number, since it uses less digits than its factorization.
1014211241001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16098591140 (or 16098591137 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1014211241001 its reverse (1001421124101), we get a palindrome (2015632365102).
It can be divided in two parts, 101421124100 and 1, that added together give a palindrome (101421124101).
The spelling of 1014211241001 in words is "one trillion, fourteen billion, two hundred eleven million, two hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •