Base | Representation |
---|---|
bin | 10011110101111111011… |
… | …111101110011111010010 |
3 | 11211100210200010011120000 |
4 | 103311333133232133102 |
5 | 134320220233444041 |
6 | 2522241012030430 |
7 | 200343234554322 |
oct | 23657737563722 |
9 | 4740720104500 |
10 | 1363643656146 |
11 | 486355326022 |
12 | 1a0349602416 |
13 | 9b78b6ab485 |
14 | 4a001d13282 |
15 | 257114aebb6 |
hex | 13d7f7ee7d2 |
1363643656146 has 20 divisors (see below), whose sum is σ = 3055571896542. Its totient is φ = 454547885328.
The previous prime is 1363643656093. The next prime is 1363643656171. The reversal of 1363643656146 is 6416563463631.
1363643656146 is a `hidden beast` number, since 1 + 3 + 6 + 3 + 6 + 4 + 36 + 561 + 46 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1236012521121 + 127631135025 = 1111761^2 + 357255^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 1363643656092 and 1363643656101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 4208776555 + ... + 4208776878.
Almost surely, 21363643656146 is an apocalyptic number.
1363643656146 is an abundant number, since it is smaller than the sum of its proper divisors (1691928240396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1363643656146 is an equidigital number, since it uses as much as digits as its factorization.
1363643656146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8417553447 (or 8417553438 counting only the distinct ones).
The product of its digits is 16796160, while the sum is 54.
The spelling of 1363643656146 in words is "one trillion, three hundred sixty-three billion, six hundred forty-three million, six hundred fifty-six thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •