Base | Representation |
---|---|
bin | 1101000011100100101100… |
… | …0101111101000000101011 |
3 | 1212211022212110100212202121 |
4 | 3100321023011331000223 |
5 | 3340143110340230201 |
6 | 50310340430212111 |
7 | 3011055200312440 |
oct | 320711305750053 |
9 | 55738773325677 |
10 | 14355040555051 |
11 | 4634a36181609 |
12 | 173a12a054037 |
13 | 80189cbb0511 |
14 | 378b0551b9c7 |
15 | 19d61a7199a1 |
hex | d0e4b17d02b |
14355040555051 has 4 divisors (see below), whose sum is σ = 16405760634352. Its totient is φ = 12304320475752.
The previous prime is 14355040555043. The next prime is 14355040555061. The reversal of 14355040555051 is 15055504055341.
It is a happy number.
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 14355040555051 - 23 = 14355040555043 is a prime.
It is a super-2 number, since 2×143550405550512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14355040554989 and 14355040555007.
It is not an unprimeable number, because it can be changed into a prime (14355040555061) 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, 1025360039640 + ... + 1025360039653.
It is an arithmetic number, because the mean of its divisors is an integer number (4101440158588).
Almost surely, 214355040555051 is an apocalyptic number.
14355040555051 is a deficient number, since it is larger than the sum of its proper divisors (2050720079301).
14355040555051 is an equidigital number, since it uses as much as digits as its factorization.
14355040555051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2050720079300.
The product of its (nonzero) digits is 750000, while the sum is 43.
The spelling of 14355040555051 in words is "fourteen trillion, three hundred fifty-five billion, forty million, five hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •