Base | Representation |
---|---|
bin | 1101000110011100001111… |
… | …0110001011001001010011 |
3 | 1220000001001012120222222002 |
4 | 3101213003312023021103 |
5 | 3342000012120231120 |
6 | 50345125453104215 |
7 | 3014451154124141 |
oct | 321470366131123 |
9 | 56001035528862 |
10 | 14404311102035 |
11 | 465391a108828 |
12 | 174779a78806b |
13 | 80642279ab2a |
14 | 37b25b008591 |
15 | 19ea51020375 |
hex | d19c3d8b253 |
14404311102035 has 16 divisors (see below), whose sum is σ = 17326188865440. Its totient is φ = 11496108556800.
The previous prime is 14404311102029. The next prime is 14404311102067. The reversal of 14404311102035 is 53020111340441.
14404311102035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14404311102035 - 226 = 14404243993171 is a prime.
It is a super-2 number, since 2×144043111020352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14404311101989 and 14404311102007.
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, 35414201 + ... + 35818629.
It is an arithmetic number, because the mean of its divisors is an integer number (1082886804090).
Almost surely, 214404311102035 is an apocalyptic number.
14404311102035 is a deficient number, since it is larger than the sum of its proper divisors (2921877763405).
14404311102035 is a wasteful number, since it uses less digits than its factorization.
14404311102035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421318.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 14404311102035 its reverse (53020111340441), we get a palindrome (67424422442476).
The spelling of 14404311102035 in words is "fourteen trillion, four hundred four billion, three hundred eleven million, one hundred two thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •