Base | Representation |
---|---|
bin | 10100010111111101101… |
… | …011001111110010111101 |
3 | 11221211221210102220001110 |
4 | 110113331223033302331 |
5 | 140414421301444431 |
6 | 2551112330032233 |
7 | 203104200362310 |
oct | 24277553176275 |
9 | 4854853386043 |
10 | 1400120343741 |
11 | 49a873484329 |
12 | 1a7429578679 |
13 | a20528213a2 |
14 | 4baa25b4977 |
15 | 266489d2346 |
hex | 145fdacfcbd |
1400120343741 has 8 divisors (see below), whose sum is σ = 2133516714304. Its totient is φ = 800068767840.
The previous prime is 1400120343701. The next prime is 1400120343763. The reversal of 1400120343741 is 1473430210041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1400120343741 - 27 = 1400120343613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1400120343699 and 1400120343708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1400120343701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33336198640 + ... + 33336198681.
It is an arithmetic number, because the mean of its divisors is an integer number (266689589288).
Almost surely, 21400120343741 is an apocalyptic number.
It is an amenable number.
1400120343741 is a deficient number, since it is larger than the sum of its proper divisors (733396370563).
1400120343741 is an equidigital number, since it uses as much as digits as its factorization.
1400120343741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66672397331.
The product of its (nonzero) digits is 8064, while the sum is 30.
Adding to 1400120343741 its reverse (1473430210041), we get a palindrome (2873550553782).
The spelling of 1400120343741 in words is "one trillion, four hundred billion, one hundred twenty million, three hundred forty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •