Base | Representation |
---|---|
bin | 10011101111000110110… |
… | …011100011100100000000 |
3 | 11210122201101211200222212 |
4 | 103233012303203210000 |
5 | 134210100011231031 |
6 | 2515015214321252 |
7 | 166662066441035 |
oct | 23570663434400 |
9 | 4718641750885 |
10 | 1356250102016 |
11 | 483200909407 |
12 | 19aa254b9228 |
13 | 9ab809acb84 |
14 | 498dddcd38c |
15 | 2542c35712b |
hex | 13bc6ce3900 |
1356250102016 has 36 divisors (see below), whose sum is σ = 2707314491532. Its totient is φ = 678096961536.
The previous prime is 1356250101989. The next prime is 1356250102019. The reversal of 1356250102016 is 6102010526531.
It can be written as a sum of positive squares in 2 ways, for example, as 412554428416 + 943695673600 = 642304^2 + 971440^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (1356250102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6974036 + ... + 7165868.
Almost surely, 21356250102016 is an apocalyptic number.
1356250102016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1356250102016 is a deficient number, since it is larger than the sum of its proper divisors (1351064389516).
1356250102016 is an equidigital number, since it uses as much as digits as its factorization.
1356250102016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219466 (or 219452 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 1356250102016 its reverse (6102010526531), we get a palindrome (7458260628547).
The spelling of 1356250102016 in words is "one trillion, three hundred fifty-six billion, two hundred fifty million, one hundred two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •