Base | Representation |
---|---|
bin | 10011110101110001000… |
… | …101111010111110100011 |
3 | 11211100011211102022002102 |
4 | 103311301011322332203 |
5 | 134314221403314111 |
6 | 2522201020441015 |
7 | 200334241606211 |
oct | 23656105727643 |
9 | 4740154368072 |
10 | 1363402010531 |
11 | 486240989100 |
12 | 1a02a06a916b |
13 | 9b7506025c2 |
14 | 49dbbbadcb1 |
15 | 256ea17b13b |
hex | 13d7117afa3 |
1363402010531 has 6 divisors (see below), whose sum is σ = 1498615433196. Its totient is φ = 1239456373100.
The previous prime is 1363402010483. The next prime is 1363402010603. The reversal of 1363402010531 is 1350102043631.
It is not a de Polignac number, because 1363402010531 - 210 = 1363402009507 is a prime.
It is a super-2 number, since 2×13634020105312 (a number of 25 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 = 1363402010494 and 1363402010503.
It is not an unprimeable number, because it can be changed into a prime (1363402010231) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5633892485 + ... + 5633892726.
It is an arithmetic number, because the mean of its divisors is an integer number (249769238866).
Almost surely, 21363402010531 is an apocalyptic number.
1363402010531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1363402010531 is a deficient number, since it is larger than the sum of its proper divisors (135213422665).
1363402010531 is a wasteful number, since it uses less digits than its factorization.
1363402010531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11267785233 (or 11267785222 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 29.
The spelling of 1363402010531 in words is "one trillion, three hundred sixty-three billion, four hundred two million, ten thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •