Base | Representation |
---|---|
bin | 1100110110100010011111… |
… | …0110100000000011011111 |
3 | 1212000220212102101222001222 |
4 | 3031220213312200003133 |
5 | 3323011003404033320 |
6 | 50015424234523555 |
7 | 2655640050443555 |
oct | 315504766400337 |
9 | 55026772358058 |
10 | 14131111002335 |
11 | 4558a74844268 |
12 | 17028545965bb |
13 | 7b673405c2c2 |
14 | 36bd412dbbd5 |
15 | 1978b156c825 |
hex | cda27da00df |
14131111002335 has 4 divisors (see below), whose sum is σ = 16957333202808. Its totient is φ = 11304888801864.
The previous prime is 14131111002331. The next prime is 14131111002353. The reversal of 14131111002335 is 53320011113141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14131111002335 - 22 = 14131111002331 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14131111002331) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1413111100229 + ... + 1413111100238.
It is an arithmetic number, because the mean of its divisors is an integer number (4239333300702).
Almost surely, 214131111002335 is an apocalyptic number.
14131111002335 is a deficient number, since it is larger than the sum of its proper divisors (2826222200473).
14131111002335 is an equidigital number, since it uses as much as digits as its factorization.
14131111002335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2826222200472.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 14131111002335 its reverse (53320011113141), we get a palindrome (67451122115476).
The spelling of 14131111002335 in words is "fourteen trillion, one hundred thirty-one billion, one hundred eleven million, two thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •