Base | Representation |
---|---|
bin | 100000001110000011100… |
… | …111110111010111010001 |
3 | 21211200000120200010112110 |
4 | 200032003213313113101 |
5 | 242234002301014441 |
6 | 4413052343015533 |
7 | 315651604033431 |
oct | 40160347672721 |
9 | 7750016603473 |
10 | 2214116423121 |
11 | 784001aa9679 |
12 | 2b913b13a5a9 |
13 | 130a37336225 |
14 | 792416b22c1 |
15 | 3c8da8d0b16 |
hex | 203839f75d1 |
2214116423121 has 8 divisors (see below), whose sum is σ = 2952671635584. Its totient is φ = 1475819413040.
The previous prime is 2214116423119. The next prime is 2214116423171. The reversal of 2214116423121 is 1213246114122.
2214116423121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2214116423121 - 21 = 2214116423119 is a prime.
It is a super-2 number, since 2×22141164231212 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2214116423171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64530585 + ... + 64564886.
It is an arithmetic number, because the mean of its divisors is an integer number (369083954448).
Almost surely, 22214116423121 is an apocalyptic number.
It is an amenable number.
2214116423121 is a deficient number, since it is larger than the sum of its proper divisors (738555212463).
2214116423121 is a wasteful number, since it uses less digits than its factorization.
2214116423121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129101191.
The product of its digits is 4608, while the sum is 30.
The spelling of 2214116423121 in words is "two trillion, two hundred fourteen billion, one hundred sixteen million, four hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •