Base | Representation |
---|---|
bin | 1010111011010011101110… |
… | …0001000001110110111101 |
3 | 1120112112021212000120222002 |
4 | 2232310323201001312331 |
5 | 3033314204120303041 |
6 | 41315055431032045 |
7 | 2346661444260410 |
oct | 256647341016675 |
9 | 46475255016862 |
10 | 12014022041021 |
11 | 3912133267860 |
12 | 142049380b625 |
13 | 691bc0747b90 |
14 | 2d76a5d91b77 |
15 | 15c7a3e5959b |
hex | aed3b841dbd |
12014022041021 has 32 divisors (see below), whose sum is σ = 16173276672000. Its totient is φ = 8618653471680.
The previous prime is 12014022040997. The next prime is 12014022041023.
12014022041021 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 12014022041021 - 26 = 12014022040957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12014022040984 and 12014022041002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12014022041023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15454421 + ... + 16213178.
It is an arithmetic number, because the mean of its divisors is an integer number (505414896000).
Almost surely, 212014022041021 is an apocalyptic number.
12014022041021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12014022041021 is a deficient number, since it is larger than the sum of its proper divisors (4159254630979).
12014022041021 is a wasteful number, since it uses less digits than its factorization.
12014022041021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31668009.
The product of its (nonzero) digits is 256, while the sum is 20.
It can be divided in two parts, 1201402 and 2041021, that added together give a palindrome (3242423).
The spelling of 12014022041021 in words is "twelve trillion, fourteen billion, twenty-two million, forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •