Base | Representation |
---|---|
bin | 101000101010000… |
… | …1010100100000110 |
3 | 10112002001121100100 |
4 | 1101110022210012 |
5 | 10243221200041 |
6 | 343212224530 |
7 | 45543565656 |
oct | 12124124406 |
9 | 3462047310 |
10 | 1364240646 |
11 | 64009520a |
12 | 320a6b146 |
13 | 18983b1b2 |
14 | cd284366 |
15 | 7eb7e6b6 |
hex | 5150a906 |
1364240646 has 24 divisors (see below), whose sum is σ = 2957474520. Its totient is φ = 454497696.
The previous prime is 1364240629. The next prime is 1364240687. The reversal of 1364240646 is 6460424631.
1364240646 is a `hidden beast` number, since 1 + 3 + 6 + 4 + 2 + 4 + 0 + 646 = 666.
It is a super-2 number, since 2×13642406462 = 3722305080396994632, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1364240646.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14625 + ... + 54243.
It is an arithmetic number, because the mean of its divisors is an integer number (123228105).
Almost surely, 21364240646 is an apocalyptic number.
1364240646 is an abundant number, since it is smaller than the sum of its proper divisors (1593233874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1364240646 is a wasteful number, since it uses less digits than its factorization.
1364240646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41540 (or 41537 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 36.
The square root of 1364240646 is about 36935.6284094369. The cubic root of 1364240646 is about 1109.0820118971.
The spelling of 1364240646 in words is "one billion, three hundred sixty-four million, two hundred forty thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •