Base | Representation |
---|---|
bin | 1100111011110101010000… |
… | …0000111100110000011111 |
3 | 1212100121120212010021122010 |
4 | 3032331110000330300133 |
5 | 3331003222320031223 |
6 | 50125303504522303 |
7 | 2665336364350656 |
oct | 316752400746037 |
9 | 55317525107563 |
10 | 14222046252063 |
11 | 4593599383311 |
12 | 17183b2620393 |
13 | 7c219686a590 |
14 | 3724ca4d019d |
15 | 199e34a8a393 |
hex | cef5403cc1f |
14222046252063 has 16 divisors (see below), whose sum is σ = 20440830252416. Its totient is φ = 8743701103200.
The previous prime is 14222046251911. The next prime is 14222046252083. The reversal of 14222046252063 is 36025264022241.
It is not a de Polignac number, because 14222046252063 - 216 = 14222046186527 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14222046252083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173445145 + ... + 173527122.
It is an arithmetic number, because the mean of its divisors is an integer number (1277551890776).
Almost surely, 214222046252063 is an apocalyptic number.
14222046252063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14222046252063 is a deficient number, since it is larger than the sum of its proper divisors (6218784000353).
14222046252063 is a wasteful number, since it uses less digits than its factorization.
14222046252063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346973334.
The product of its (nonzero) digits is 276480, while the sum is 39.
The spelling of 14222046252063 in words is "fourteen trillion, two hundred twenty-two billion, forty-six million, two hundred fifty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.735 sec. • engine limits •