Base | Representation |
---|---|
bin | 1100110001010111010001… |
… | …1110011000010001101011 |
3 | 1211201102101012211102102111 |
4 | 3030111310132120101223 |
5 | 3320031412231231220 |
6 | 45510522034543151 |
7 | 2646341601260626 |
oct | 314256436302153 |
9 | 54642335742374 |
10 | 14042202211435 |
11 | 45242a0083782 |
12 | 16a9581137ab7 |
13 | 7ab2353305a8 |
14 | 3679092d0dbd |
15 | 19540addc15a |
hex | cc57479846b |
14042202211435 has 16 divisors (see below), whose sum is σ = 17397220700160. Its totient is φ = 10869501777120.
The previous prime is 14042202211417. The next prime is 14042202211441. The reversal of 14042202211435 is 53411220224041.
14042202211435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-14042202211435 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 14042202211397 and 14042202211406.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6936495 + ... + 8729224.
It is an arithmetic number, because the mean of its divisors is an integer number (1087326293760).
Almost surely, 214042202211435 is an apocalyptic number.
14042202211435 is a deficient number, since it is larger than the sum of its proper divisors (3355018488725).
14042202211435 is a wasteful number, since it uses less digits than its factorization.
14042202211435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15671538.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 14042202211435 its reverse (53411220224041), we get a palindrome (67453422435476).
The spelling of 14042202211435 in words is "fourteen trillion, forty-two billion, two hundred two million, two hundred eleven thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •