Base | Representation |
---|---|
bin | 1001011110100010010010… |
… | …0101010111001001111011 |
3 | 1100220011100222000012212011 |
4 | 2113220210211113021323 |
5 | 2331211034313342133 |
6 | 34054550440230351 |
7 | 2123556244164655 |
oct | 227504445271173 |
9 | 40804328005764 |
10 | 10420204434043 |
11 | 3358202826798 |
12 | 120360946b3b7 |
13 | 5a780c61ba81 |
14 | 2804aa7d16d5 |
15 | 1310c04da6cd |
hex | 97a2495727b |
10420204434043 has 16 divisors (see below), whose sum is σ = 10796845565376. Its totient is φ = 10051047086080.
The previous prime is 10420204434011. The next prime is 10420204434089. The reversal of 10420204434043 is 34043440202401.
It is a cyclic number.
It is not a de Polignac number, because 10420204434043 - 25 = 10420204434011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10420204433996 and 10420204434014.
It is not an unprimeable number, because it can be changed into a prime (10420204434443) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2593930 + ... + 5250607.
It is an arithmetic number, because the mean of its divisors is an integer number (674802847836).
Almost surely, 210420204434043 is an apocalyptic number.
10420204434043 is a deficient number, since it is larger than the sum of its proper divisors (376641131333).
10420204434043 is an equidigital number, since it uses as much as digits as its factorization.
10420204434043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7845014.
The product of its (nonzero) digits is 36864, while the sum is 31.
Adding to 10420204434043 its reverse (34043440202401), we get a palindrome (44463644636444).
The spelling of 10420204434043 in words is "ten trillion, four hundred twenty billion, two hundred four million, four hundred thirty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •