Base | Representation |
---|---|
bin | 1101001101001100100001… |
… | …0111110100000010010111 |
3 | 1220102010120020102000012012 |
4 | 3103103020113310002113 |
5 | 3400400134343134020 |
6 | 50514320210014435 |
7 | 3026026560203462 |
oct | 323231027640227 |
9 | 56363506360165 |
10 | 14520351146135 |
11 | 469905674a41a |
12 | 176618427741b |
13 | 814356444413 |
14 | 382b084622d9 |
15 | 1a2a935107c5 |
hex | d34c85f4097 |
14520351146135 has 16 divisors (see below), whose sum is σ = 17542893060000. Its totient is φ = 11537313388416.
The previous prime is 14520351146131. The next prime is 14520351146137. The reversal of 14520351146135 is 53164115302541.
It is a cyclic number.
It is not a de Polignac number, because 14520351146135 - 22 = 14520351146131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14520351146092 and 14520351146101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14520351146131) 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, 7760192 + ... + 9447818.
It is an arithmetic number, because the mean of its divisors is an integer number (1096430816250).
Almost surely, 214520351146135 is an apocalyptic number.
14520351146135 is a deficient number, since it is larger than the sum of its proper divisors (3022541913865).
14520351146135 is a wasteful number, since it uses less digits than its factorization.
14520351146135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1699330.
The product of its (nonzero) digits is 216000, while the sum is 41.
Adding to 14520351146135 its reverse (53164115302541), we get a palindrome (67684466448676).
The spelling of 14520351146135 in words is "fourteen trillion, five hundred twenty billion, three hundred fifty-one million, one hundred forty-six thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •