Base | Representation |
---|---|
bin | 100101001101000… |
… | …1000011000110001 |
3 | 10020000000110120201 |
4 | 1022122020120301 |
5 | 10024040122311 |
6 | 323512435201 |
7 | 42635630266 |
oct | 11232103061 |
9 | 3200013521 |
10 | 1248364081 |
11 | 59073a458 |
12 | 2aa0a8b01 |
13 | 16b829093 |
14 | bbb1d26d |
15 | 748e09c1 |
hex | 4a688631 |
1248364081 has 4 divisors (see below), whose sum is σ = 1250044992. Its totient is φ = 1246683172.
The previous prime is 1248364057. The next prime is 1248364097. The reversal of 1248364081 is 1804638421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1248364081 - 217 = 1248233009 is a prime.
It is a super-2 number, since 2×12483640812 = 3116825757461949122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1248364081.
It is not an unprimeable number, because it can be changed into a prime (1248364181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 839341 + ... + 840826.
It is an arithmetic number, because the mean of its divisors is an integer number (312511248).
Almost surely, 21248364081 is an apocalyptic number.
It is an amenable number.
1248364081 is a deficient number, since it is larger than the sum of its proper divisors (1680911).
1248364081 is an equidigital number, since it uses as much as digits as its factorization.
1248364081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1680910.
The product of its (nonzero) digits is 36864, while the sum is 37.
The square root of 1248364081 is about 35332.1960964784. The cubic root of 1248364081 is about 1076.7472091093.
The spelling of 1248364081 in words is "one billion, two hundred forty-eight million, three hundred sixty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •