Base | Representation |
---|---|
bin | 10010001011000010000… |
… | …011000110001001011001 |
3 | 11102101100202012012100202 |
4 | 102023002003012021121 |
5 | 130430013300413403 |
6 | 2353404454311545 |
7 | 156136221525464 |
oct | 22130203061131 |
9 | 4371322165322 |
10 | 1248796107353 |
11 | 44167a934843 |
12 | 1820373585b5 |
13 | 909b7acc502 |
14 | 44628dd42db |
15 | 2273da26688 |
hex | 122c20c6259 |
1248796107353 has 4 divisors (see below), whose sum is σ = 1248838559460. Its totient is φ = 1248753655248.
The previous prime is 1248796107329. The next prime is 1248796107437. The reversal of 1248796107353 is 3537016978421.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 917126082889 + 331670024464 = 957667^2 + 575908^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1248796107353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1248796107553) 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, 21181898 + ... + 21240771.
It is an arithmetic number, because the mean of its divisors is an integer number (312209639865).
It is a 1-persistent number, because it is pandigital, but 2⋅1248796107353 = 2497592214706 is not.
Almost surely, 21248796107353 is an apocalyptic number.
It is an amenable number.
1248796107353 is a deficient number, since it is larger than the sum of its proper divisors (42452107).
1248796107353 is an equidigital number, since it uses as much as digits as its factorization.
1248796107353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42452106.
The product of its (nonzero) digits is 7620480, while the sum is 56.
The spelling of 1248796107353 in words is "one trillion, two hundred forty-eight billion, seven hundred ninety-six million, one hundred seven thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •