Base | Representation |
---|---|
bin | 10011110101100000111… |
… | …010101111101000101010 |
3 | 11211022110220210111121110 |
4 | 103311200322233220222 |
5 | 134313142421120114 |
6 | 2522114044251150 |
7 | 200324435210154 |
oct | 23654072575052 |
9 | 4738426714543 |
10 | 1363130645034 |
11 | 4861117921a4 |
12 | 1a0225840ab6 |
13 | 9b70931c0c2 |
14 | 49d93b31ad4 |
15 | 256d1426759 |
hex | 13d60eafa2a |
1363130645034 has 8 divisors (see below), whose sum is σ = 2726261290080. Its totient is φ = 454376881676.
The previous prime is 1363130645027. The next prime is 1363130645057. The reversal of 1363130645034 is 4305460313631.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1363130645034 is an admirable number.
It is a super-2 number, since 2×13631306450342 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1363130644983 and 1363130645001.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113594220414 + ... + 113594220425.
It is an arithmetic number, because the mean of its divisors is an integer number (340782661260).
Almost surely, 21363130645034 is an apocalyptic number.
1363130645034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1363130645034 is a wasteful number, since it uses less digits than its factorization.
1363130645034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227188440844.
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 1363130645034 its reverse (4305460313631), we get a palindrome (5668590958665).
The spelling of 1363130645034 in words is "one trillion, three hundred sixty-three billion, one hundred thirty million, six hundred forty-five thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •