Base | Representation |
---|---|
bin | 10001111101010011010… |
… | …000011100110111110101 |
3 | 11100222022020101001201020 |
4 | 101331103100130313311 |
5 | 130204314410413240 |
6 | 2342525454251353 |
7 | 155104653425334 |
oct | 21752320346765 |
9 | 4328266331636 |
10 | 1234052435445 |
11 | 4363a4478925 |
12 | 17b2017b6b59 |
13 | 8c4a84002ab |
14 | 43a2ac55d1b |
15 | 221794960d0 |
hex | 11f5341cdf5 |
1234052435445 has 64 divisors (see below), whose sum is σ = 2081448230400. Its totient is φ = 623097446400.
The previous prime is 1234052435437. The next prime is 1234052435503. The reversal of 1234052435445 is 5445342504321.
It is not a de Polignac number, because 1234052435445 - 23 = 1234052435437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1234052435397 and 1234052435406.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 164778261 + ... + 164785749.
It is an arithmetic number, because the mean of its divisors is an integer number (32522628600).
Almost surely, 21234052435445 is an apocalyptic number.
1234052435445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1234052435445 is a deficient number, since it is larger than the sum of its proper divisors (847395794955).
1234052435445 is a wasteful number, since it uses less digits than its factorization.
1234052435445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12350.
The product of its (nonzero) digits is 1152000, while the sum is 42.
Adding to 1234052435445 its reverse (5445342504321), we get a palindrome (6679394939766).
The spelling of 1234052435445 in words is "one trillion, two hundred thirty-four billion, fifty-two million, four hundred thirty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •