Base | Representation |
---|---|
bin | 10011110010111110111… |
… | …111111101001011101110 |
3 | 11211001110121010211110220 |
4 | 103302332333331023232 |
5 | 134242112002233004 |
6 | 2520544323312210 |
7 | 200200221034314 |
oct | 23627677751356 |
9 | 4731417124426 |
10 | 1360414102254 |
11 | 484a48327419 |
12 | 19b7a7b1b666 |
13 | 9b395592a3c |
14 | 49bb70340b4 |
15 | 255c2bc4dd9 |
hex | 13cbeffd2ee |
1360414102254 has 16 divisors (see below), whose sum is σ = 2721785265792. Its totient is φ = 453311857208.
The previous prime is 1360414102217. The next prime is 1360414102259. The reversal of 1360414102254 is 4522014140631.
It is a happy number.
It is a super-2 number, since 2×13604141022542 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1360414102259) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 39859074 + ... + 39893189.
It is an arithmetic number, because the mean of its divisors is an integer number (170111579112).
Almost surely, 21360414102254 is an apocalyptic number.
1360414102254 is an abundant number, since it is smaller than the sum of its proper divisors (1361371163538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1360414102254 is a wasteful number, since it uses less digits than its factorization.
1360414102254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79755111.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 1360414102254 its reverse (4522014140631), we get a palindrome (5882428242885).
The spelling of 1360414102254 in words is "one trillion, three hundred sixty billion, four hundred fourteen million, one hundred two thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •