Base | Representation |
---|---|
bin | 100101000101010… |
… | …1000011100000001 |
3 | 10012201101001011100 |
4 | 1022022220130001 |
5 | 10022020113212 |
6 | 323245405013 |
7 | 42556245606 |
oct | 11212503401 |
9 | 3181331140 |
10 | 1244301057 |
11 | 58941488a |
12 | 2a8869769 |
13 | 16aa3591c |
14 | bb3826ad |
15 | 7438bbdc |
hex | 4a2a8701 |
1244301057 has 48 divisors (see below), whose sum is σ = 1910563200. Its totient is φ = 779170560.
The previous prime is 1244301049. The next prime is 1244301059. The reversal of 1244301057 is 7501034421.
1244301057 is a `hidden beast` number, since 124 + 430 + 105 + 7 = 666.
It is not a de Polignac number, because 1244301057 - 23 = 1244301049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1244301057.
It is not an unprimeable number, because it can be changed into a prime (1244301059) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 1537669 + ... + 1538477.
It is an arithmetic number, because the mean of its divisors is an integer number (39803400).
Almost surely, 21244301057 is an apocalyptic number.
It is an amenable number.
1244301057 is a deficient number, since it is larger than the sum of its proper divisors (666262143).
1244301057 is a wasteful number, since it uses less digits than its factorization.
1244301057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 998 (or 995 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 1244301057 is about 35274.6517629870. The cubic root of 1244301057 is about 1075.5777840825.
Adding to 1244301057 its reverse (7501034421), we get a palindrome (8745335478).
The spelling of 1244301057 in words is "one billion, two hundred forty-four million, three hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •