Base | Representation |
---|---|
bin | 111111001100100110010… |
… | …101000111101100000111 |
3 | 120101011200000212122111010 |
4 | 333030212111013230013 |
5 | 1032123131340210413 |
6 | 13123025142413303 |
7 | 625521665325003 |
oct | 77144625075407 |
9 | 16334600778433 |
10 | 4342855006983 |
11 | 1424881484a09 |
12 | 5a1811431233 |
13 | 2566b632622c |
14 | 1102a3cb1703 |
15 | 77e7ab03dc3 |
hex | 3f326547b07 |
4342855006983 has 32 divisors (see below), whose sum is σ = 6172108911360. Its totient is φ = 2708299411200.
The previous prime is 4342855006943. The next prime is 4342855007011. The reversal of 4342855006983 is 3896005582434.
It is not a de Polignac number, because 4342855006983 - 29 = 4342855006471 is a prime.
It is a super-2 number, since 2×43428550069832 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4342855006943) 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 31 ways as a sum of consecutive naturals, for example, 8265685 + ... + 8775377.
It is an arithmetic number, because the mean of its divisors is an integer number (192878403480).
Almost surely, 24342855006983 is an apocalyptic number.
4342855006983 is a deficient number, since it is larger than the sum of its proper divisors (1829253904377).
4342855006983 is a wasteful number, since it uses less digits than its factorization.
4342855006983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511599.
The product of its (nonzero) digits is 24883200, while the sum is 57.
The spelling of 4342855006983 in words is "four trillion, three hundred forty-two billion, eight hundred fifty-five million, six thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •