Base | Representation |
---|---|
bin | 10011111100111101001… |
… | …101000101011000001111 |
3 | 11212002002210211021222222 |
4 | 103330331031011120033 |
5 | 134431024040020003 |
6 | 2525515014125555 |
7 | 201026444444561 |
oct | 23747515053017 |
9 | 4762083737888 |
10 | 1371121407503 |
11 | 489542320321 |
12 | 1a18959508bb |
13 | 9c3b0979713 |
14 | 4a5110b3331 |
15 | 259ecbe9c38 |
hex | 13f3d34560f |
1371121407503 has 8 divisors (see below), whose sum is σ = 1394902521120. Its totient is φ = 1347382349280.
The previous prime is 1371121407433. The next prime is 1371121407517. The reversal of 1371121407503 is 3057041211731.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1371121407503 - 226 = 1371054298639 is a prime.
It is a super-2 number, since 2×13711214075032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1371121404503) 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 7 ways as a sum of consecutive naturals, for example, 10448075 + ... + 10578492.
It is an arithmetic number, because the mean of its divisors is an integer number (174362815140).
Almost surely, 21371121407503 is an apocalyptic number.
1371121407503 is a deficient number, since it is larger than the sum of its proper divisors (23781113617).
1371121407503 is a wasteful number, since it uses less digits than its factorization.
1371121407503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21027697.
The product of its (nonzero) digits is 17640, while the sum is 35.
The spelling of 1371121407503 in words is "one trillion, three hundred seventy-one billion, one hundred twenty-one million, four hundred seven thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •