Base | Representation |
---|---|
bin | 1100110000001101100001… |
… | …0100001101010100001111 |
3 | 1211122112021100001022201102 |
4 | 3030003120110031110033 |
5 | 3314220340010231343 |
6 | 45453445220533315 |
7 | 2645041130022155 |
oct | 314033024152417 |
9 | 54575240038642 |
10 | 14022402430223 |
11 | 451695a677030 |
12 | 16a577625123b |
13 | 7a93cb288715 |
14 | 36698b8473d5 |
15 | 194b4ca203b8 |
hex | cc0d850d50f |
14022402430223 has 8 divisors (see below), whose sum is σ = 15303585605376. Its totient is φ = 12742289141400.
The previous prime is 14022402430147. The next prime is 14022402430249. The reversal of 14022402430223 is 32203420422041.
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 14022402430223 - 224 = 14022385653007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14022402430273) 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 7 ways as a sum of consecutive naturals, for example, 267444173 + ... + 267496598.
It is an arithmetic number, because the mean of its divisors is an integer number (1912948200672).
Almost surely, 214022402430223 is an apocalyptic number.
14022402430223 is a deficient number, since it is larger than the sum of its proper divisors (1281183175153).
14022402430223 is a wasteful number, since it uses less digits than its factorization.
14022402430223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534943165.
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 14022402430223 its reverse (32203420422041), we get a palindrome (46225822852264).
The spelling of 14022402430223 in words is "fourteen trillion, twenty-two billion, four hundred two million, four hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •