Base | Representation |
---|---|
bin | 1100101111110010010101… |
… | …0001000111010010010111 |
3 | 1211121211102122212210002112 |
4 | 3023330211101013102113 |
5 | 3314110413000431020 |
6 | 45450241044101235 |
7 | 2644362221264111 |
oct | 313744521072227 |
9 | 54554378783075 |
10 | 14015103530135 |
11 | 451385462a3a4 |
12 | 16a427999481b |
13 | 7a880707b526 |
14 | 3664983223b1 |
15 | 194871d632c5 |
hex | cbf25447497 |
14015103530135 has 8 divisors (see below), whose sum is σ = 16818830459280. Its totient is φ = 11211612008704.
The previous prime is 14015103530089. The next prime is 14015103530149. The reversal of 14015103530135 is 53103530151041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14015103530135 - 220 = 14015102481559 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58720922 + ... + 58959111.
It is an arithmetic number, because the mean of its divisors is an integer number (2102353807410).
Almost surely, 214015103530135 is an apocalyptic number.
14015103530135 is a deficient number, since it is larger than the sum of its proper divisors (2803726929145).
14015103530135 is a wasteful number, since it uses less digits than its factorization.
14015103530135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117703857.
The product of its (nonzero) digits is 13500, while the sum is 32.
Adding to 14015103530135 its reverse (53103530151041), we get a palindrome (67118633681176).
The spelling of 14015103530135 in words is "fourteen trillion, fifteen billion, one hundred three million, five hundred thirty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •