Base | Representation |
---|---|
bin | 10100000100000001010… |
… | …010101001111100000001 |
3 | 11212210200101220010120201 |
4 | 110010001102221330001 |
5 | 140042042234411401 |
6 | 2533211402005201 |
7 | 201415424036605 |
oct | 24040122517401 |
9 | 4783611803521 |
10 | 1378706169601 |
11 | 491784765352 |
12 | 1a3251aa6801 |
13 | a001c174527 |
14 | 4aa3056b505 |
15 | 25ce3a21b01 |
hex | 141014a9f01 |
1378706169601 has 4 divisors (see below), whose sum is σ = 1381181405652. Its totient is φ = 1376230933552.
The previous prime is 1378706169499. The next prime is 1378706169637. The reversal of 1378706169601 is 1069616078731.
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 659603865600 + 719102304001 = 812160^2 + 847999^2 .
It is a cyclic number.
It is not a de Polignac number, because 1378706169601 - 219 = 1378705645313 is a prime.
It is a super-2 number, since 2×13787061696012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1378706169671) 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, 1237617190 + ... + 1237618303.
It is an arithmetic number, because the mean of its divisors is an integer number (345295351413).
Almost surely, 21378706169601 is an apocalyptic number.
It is an amenable number.
1378706169601 is a deficient number, since it is larger than the sum of its proper divisors (2475236051).
1378706169601 is an equidigital number, since it uses as much as digits as its factorization.
1378706169601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2475236050.
The product of its (nonzero) digits is 2286144, while the sum is 55.
The spelling of 1378706169601 in words is "one trillion, three hundred seventy-eight billion, seven hundred six million, one hundred sixty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •