Base | Representation |
---|---|
bin | 1100111011010001000110… |
… | …0110010010001011111111 |
3 | 1212022200112112220210002000 |
4 | 3032310101212102023333 |
5 | 3330323334024443403 |
6 | 50121020525433343 |
7 | 2664544041005406 |
oct | 316642146221377 |
9 | 55280475823060 |
10 | 14212342031103 |
11 | 458a46961a497 |
12 | 171654470b853 |
13 | 7c12ab2308b8 |
14 | 371c4976263d |
15 | 199a67b557a3 |
hex | ced119922ff |
14212342031103 has 16 divisors (see below), whose sum is σ = 22163496345600. Its totient is φ = 8976216019320.
The previous prime is 14212342031059. The next prime is 14212342031159. The reversal of 14212342031103 is 30113024321241.
14212342031103 is a `hidden beast` number, since 1 + 4 + 2 + 1 + 2 + 342 + 0 + 311 + 0 + 3 = 666.
It is not a de Polignac number, because 14212342031103 - 28 = 14212342030847 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14212342031603) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13852184703 + ... + 13852185728.
It is an arithmetic number, because the mean of its divisors is an integer number (1385218521600).
Almost surely, 214212342031103 is an apocalyptic number.
14212342031103 is a deficient number, since it is larger than the sum of its proper divisors (7951154314497).
14212342031103 is a wasteful number, since it uses less digits than its factorization.
14212342031103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27704370459 (or 27704370453 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 14212342031103 its reverse (30113024321241), we get a palindrome (44325366352344).
The spelling of 14212342031103 in words is "fourteen trillion, two hundred twelve billion, three hundred forty-two million, thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •