Base | Representation |
---|---|
bin | 1100110101100001000011… |
… | …0111011011111101001101 |
3 | 1211222020112020211010021112 |
4 | 3031120100313123331031 |
5 | 3322214020122040131 |
6 | 50003401233141405 |
7 | 2654445546244112 |
oct | 315302067337515 |
9 | 54866466733245 |
10 | 14113545502541 |
11 | 4551580551291 |
12 | 16bb3719ba865 |
13 | 7b4b94b5c744 |
14 | 36b156496909 |
15 | 1971d43e002b |
hex | cd610ddbf4d |
14113545502541 has 4 divisors (see below), whose sum is σ = 14943754061532. Its totient is φ = 13283336943552.
The previous prime is 14113545502531. The next prime is 14113545502543. The reversal of 14113545502541 is 14520554531141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6770122986916 + 7343422515625 = 2601946^2 + 2709875^2 .
It is a cyclic number.
It is not a de Polignac number, because 14113545502541 - 242 = 9715498991437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14113545502543) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 415104279470 + ... + 415104279503.
It is an arithmetic number, because the mean of its divisors is an integer number (3735938515383).
Almost surely, 214113545502541 is an apocalyptic number.
It is an amenable number.
14113545502541 is a deficient number, since it is larger than the sum of its proper divisors (830208558991).
14113545502541 is an equidigital number, since it uses as much as digits as its factorization.
14113545502541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830208558990.
The product of its (nonzero) digits is 240000, while the sum is 41.
The spelling of 14113545502541 in words is "fourteen trillion, one hundred thirteen billion, five hundred forty-five million, five hundred two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •