Base | Representation |
---|---|
bin | 10001101000110001000… |
… | …100110001111001111001 |
3 | 11021212101122120021201210 |
4 | 101220301010301321321 |
5 | 124324141023122131 |
6 | 2324441554233333 |
7 | 153364406663040 |
oct | 21506104617171 |
9 | 4255348507653 |
10 | 1212004114041 |
11 | 42800a7a86a6 |
12 | 176a89885849 |
13 | 8a3a355cc76 |
14 | 429388d7557 |
15 | 217d89c0146 |
hex | 11a31131e79 |
1212004114041 has 32 divisors (see below), whose sum is σ = 1891498132480. Its totient is φ = 675864471744.
The previous prime is 1212004114037. The next prime is 1212004114177. The reversal of 1212004114041 is 1404114002121.
It is not a de Polignac number, because 1212004114041 - 22 = 1212004114037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212004113999 and 1212004114017.
It is not an unprimeable number, because it can be changed into a prime (1212004115041) 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 31 ways as a sum of consecutive naturals, for example, 416475 + ... + 1611663.
It is an arithmetic number, because the mean of its divisors is an integer number (59109316640).
Almost surely, 21212004114041 is an apocalyptic number.
It is an amenable number.
1212004114041 is a deficient number, since it is larger than the sum of its proper divisors (679494018439).
1212004114041 is a wasteful number, since it uses less digits than its factorization.
1212004114041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196365.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 1212004114041 its reverse (1404114002121), we get a palindrome (2616118116162).
The spelling of 1212004114041 in words is "one trillion, two hundred twelve billion, four million, one hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •