Base | Representation |
---|---|
bin | 10100000110101000101… |
… | …110101010110011101101 |
3 | 11220001221011210011101121 |
4 | 110012220232222303231 |
5 | 140113320404331034 |
6 | 2534354231340541 |
7 | 201545144236345 |
oct | 24065056526355 |
9 | 4801834704347 |
10 | 1381515308269 |
11 | 492996414858 |
12 | 1a38b6821751 |
13 | a0379151265 |
14 | 4ac1968dd25 |
15 | 25e0a4641b4 |
hex | 141a8baaced |
1381515308269 has 4 divisors (see below), whose sum is σ = 1413643571296. Its totient is φ = 1349387045244.
The previous prime is 1381515308237. The next prime is 1381515308293. The reversal of 1381515308269 is 9628035151831.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1381515308269 - 25 = 1381515308237 is a prime.
It is a super-2 number, since 2×13815153082692 (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 (1381515308669) 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, 16064131449 + ... + 16064131534.
It is an arithmetic number, because the mean of its divisors is an integer number (353410892824).
Almost surely, 21381515308269 is an apocalyptic number.
It is an amenable number.
1381515308269 is a deficient number, since it is larger than the sum of its proper divisors (32128263027).
1381515308269 is an equidigital number, since it uses as much as digits as its factorization.
1381515308269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32128263026.
The product of its (nonzero) digits is 1555200, while the sum is 52.
The spelling of 1381515308269 in words is "one trillion, three hundred eighty-one billion, five hundred fifteen million, three hundred eight thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •