Base | Representation |
---|---|
bin | 1100110101010111101011… |
… | …1100010110111001010111 |
3 | 1211222000000221212000202112 |
4 | 3031111322330112321113 |
5 | 3322143342213211020 |
6 | 50002303501501235 |
7 | 2654326324514105 |
oct | 315257274267127 |
9 | 54860027760675 |
10 | 14111030210135 |
11 | 45504aa752931 |
12 | 16ba98b57181b |
13 | 7b4883a07841 |
14 | 36ad983c4c75 |
15 | 1970d86932c5 |
hex | cd57af16e57 |
14111030210135 has 8 divisors (see below), whose sum is σ = 16936652306976. Its totient is φ = 11286546798240.
The previous prime is 14111030210107. The next prime is 14111030210171. The reversal of 14111030210135 is 53101203011141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14111030210135 - 216 = 14111030144599 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14111030210135.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 284643971 + ... + 284693540.
It is an arithmetic number, because the mean of its divisors is an integer number (2117081538372).
Almost surely, 214111030210135 is an apocalyptic number.
14111030210135 is a deficient number, since it is larger than the sum of its proper divisors (2825622096841).
14111030210135 is an equidigital number, since it uses as much as digits as its factorization.
14111030210135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569342473.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 14111030210135 its reverse (53101203011141), we get a palindrome (67212233221276).
The spelling of 14111030210135 in words is "fourteen trillion, one hundred eleven billion, thirty million, two hundred ten thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •