Base | Representation |
---|---|
bin | 110000101100011111011101… |
… | …000010001000010010111011 |
3 | 1001002021211211212121200201112 |
4 | 300230133131002020102323 |
5 | 211032324140111302301 |
6 | 2035253232310110535 |
7 | 63052546131112511 |
oct | 6054373502102273 |
9 | 1032254755550645 |
10 | 214163662603451 |
11 | 6226a3323392a0 |
12 | 2002a42934b44b |
13 | 926671520b802 |
14 | 3ac58101b04b1 |
15 | 19b5d4d2559bb |
hex | c2c7dd0884bb |
214163662603451 has 16 divisors (see below), whose sum is σ = 236838287339520. Its totient is φ = 192023344941120.
The previous prime is 214163662603447. The next prime is 214163662603481. The reversal of 214163662603451 is 154306266361412.
It is a happy number.
It is not a de Polignac number, because 214163662603451 - 22 = 214163662603447 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 214163662603451.
It is not an unprimeable number, because it can be changed into a prime (214163662603421) 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, 37790246 + ... + 43086308.
It is an arithmetic number, because the mean of its divisors is an integer number (14802392958720).
Almost surely, 2214163662603451 is an apocalyptic number.
214163662603451 is a deficient number, since it is larger than the sum of its proper divisors (22674624736069).
214163662603451 is a wasteful number, since it uses less digits than its factorization.
214163662603451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5346506.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 214163662603451 in words is "two hundred fourteen trillion, one hundred sixty-three billion, six hundred sixty-two million, six hundred three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •