Base | Representation |
---|---|
bin | 1101000011100101010111… |
… | …1110001000000000111111 |
3 | 1212211100100011202200222212 |
4 | 3100321111332020000333 |
5 | 3340143444100133401 |
6 | 50310410505531035 |
7 | 3011062544441516 |
oct | 320712576100077 |
9 | 55740304680885 |
10 | 14355223052351 |
11 | 463501a19a525 |
12 | 173a17b1a3a7b |
13 | 8018cb949c9c |
14 | 378b2186567d |
15 | 19d62b767dbb |
hex | d0e55f8803f |
14355223052351 has 2 divisors, whose sum is σ = 14355223052352. Its totient is φ = 14355223052350.
The previous prime is 14355223052341. The next prime is 14355223052371. The reversal of 14355223052351 is 15325032255341.
14355223052351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14355223052351 is a prime.
It is a super-2 number, since 2×143552230523512 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14355223052299 and 14355223052308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14355223052341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7177611526175 + 7177611526176.
It is an arithmetic number, because the mean of its divisors is an integer number (7177611526176).
Almost surely, 214355223052351 is an apocalyptic number.
14355223052351 is a deficient number, since it is larger than the sum of its proper divisors (1).
14355223052351 is an equidigital number, since it uses as much as digits as its factorization.
14355223052351 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 14355223052351 in words is "fourteen trillion, three hundred fifty-five billion, two hundred twenty-three million, fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •