Base | Representation |
---|---|
bin | 10011110110100001011… |
… | …001111011110001111000 |
3 | 11211102021022121122010121 |
4 | 103312201121323301320 |
5 | 134322401404004224 |
6 | 2522413253423024 |
7 | 200363313313141 |
oct | 23664131736170 |
9 | 4742238548117 |
10 | 1364212563064 |
11 | 48661747722a |
12 | 1a048803aa74 |
13 | 9b84c50b6a0 |
14 | 4a0576c4ac8 |
15 | 257463d9be4 |
hex | 13da167bc78 |
1364212563064 has 16 divisors (see below), whose sum is σ = 2754659983320. Its totient is φ = 629636567520.
The previous prime is 1364212563041. The next prime is 1364212563101. The reversal of 1364212563064 is 4603652124631.
It is a happy number.
It is a super-2 number, since 2×13642125630642 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1364212563064.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6558714142 + ... + 6558714349.
Almost surely, 21364212563064 is an apocalyptic number.
It is an amenable number.
1364212563064 is an abundant number, since it is smaller than the sum of its proper divisors (1390447420256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1364212563064 is a wasteful number, since it uses less digits than its factorization.
1364212563064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13117428510 (or 13117428506 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 43.
Adding to 1364212563064 its reverse (4603652124631), we get a palindrome (5967864687695).
The spelling of 1364212563064 in words is "one trillion, three hundred sixty-four billion, two hundred twelve million, five hundred sixty-three thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •