Base | Representation |
---|---|
bin | 10010000111100101110… |
… | …101001011000101010001 |
3 | 11102000211021002011202111 |
4 | 102013211311023011101 |
5 | 130344431434020113 |
6 | 2351554113345321 |
7 | 155645526605221 |
oct | 22074565130521 |
9 | 4360737064674 |
10 | 1245101470033 |
11 | 440054358073 |
12 | 181385b68241 |
13 | 90549535795 |
14 | 4439844c081 |
15 | 225c44be13d |
hex | 121e5d4b151 |
1245101470033 has 16 divisors (see below), whose sum is σ = 1307167428096. Its totient is φ = 1184988026880.
The previous prime is 1245101470009. The next prime is 1245101470043. The reversal of 1245101470033 is 3300741015421.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1245101470033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1245101469977 and 1245101470004.
It is not an unprimeable number, because it can be changed into a prime (1245101470003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2312016 + ... + 2799217.
It is an arithmetic number, because the mean of its divisors is an integer number (81697964256).
Almost surely, 21245101470033 is an apocalyptic number.
It is an amenable number.
1245101470033 is a deficient number, since it is larger than the sum of its proper divisors (62065958063).
1245101470033 is an equidigital number, since it uses as much as digits as its factorization.
1245101470033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5111424.
The product of its (nonzero) digits is 10080, while the sum is 31.
Adding to 1245101470033 its reverse (3300741015421), we get a palindrome (4545842485454).
The spelling of 1245101470033 in words is "one trillion, two hundred forty-five billion, one hundred one million, four hundred seventy thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •