Base | Representation |
---|---|
bin | 10011101111001111001… |
… | …100111110110101101101 |
3 | 11210200002012221022012201 |
4 | 103233033030332311231 |
5 | 134210342043010234 |
6 | 2515041210101501 |
7 | 166665430066561 |
oct | 23571714766555 |
9 | 4720065838181 |
10 | 1356390985069 |
11 | 48327339398a |
12 | 19aa6471a891 |
13 | 9aba3c39123 |
14 | 499149c36a1 |
15 | 254398d5314 |
hex | 13bcf33ed6d |
1356390985069 has 8 divisors (see below), whose sum is σ = 1367035383168. Its totient is φ = 1345776614640.
The previous prime is 1356390984947. The next prime is 1356390985109. The reversal of 1356390985069 is 9605890936531.
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 1356390985069 - 211 = 1356390983021 is a prime.
It is a super-2 number, since 2×13563909850692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1356390985069.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1356390085069) 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, 7416217 + ... + 7596910.
It is an arithmetic number, because the mean of its divisors is an integer number (170879422896).
Almost surely, 21356390985069 is an apocalyptic number.
It is an amenable number.
1356390985069 is a deficient number, since it is larger than the sum of its proper divisors (10644398099).
1356390985069 is a wasteful number, since it uses less digits than its factorization.
1356390985069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15013835.
The product of its (nonzero) digits is 47239200, while the sum is 64.
The spelling of 1356390985069 in words is "one trillion, three hundred fifty-six billion, three hundred ninety million, nine hundred eighty-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •