Base | Representation |
---|---|
bin | 1000001111110111… |
… | …1100000010000000 |
3 | 12201022010111022202 |
4 | 2003331330002000 |
5 | 14013244130333 |
6 | 1003410452332 |
7 | 105603063002 |
oct | 20375740200 |
9 | 5638114282 |
10 | 2214051968 |
11 | a36858017 |
12 | 5195940a8 |
13 | 29391162b |
14 | 170098372 |
15 | ce5955e8 |
hex | 83f7c080 |
2214051968 has 24 divisors (see below), whose sum is σ = 4411867455. Its totient is φ = 1106759808.
The previous prime is 2214051943. The next prime is 2214051971. The reversal of 2214051968 is 8691504122.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 1107025984 + 1107025984 = 33272^2 + 33272^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=33272.
It is a super-2 number, since 2×22140519682 = 9804052234009346048, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 530273 + ... + 534431.
Almost surely, 22214051968 is an apocalyptic number.
It is an amenable number.
2214051968 is a deficient number, since it is larger than the sum of its proper divisors (2197815487).
2214051968 is an frugal number, since it uses more digits than its factorization.
2214051968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8332 (or 4161 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 38.
The square root of 2214051968 is about 47053.7136472776. The cubic root of 2214051968 is about 1303.3546432124.
The spelling of 2214051968 in words is "two billion, two hundred fourteen million, fifty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •