Base | Representation |
---|---|
bin | 111010100011101011000… |
… | …111011111110111011111 |
3 | 112020200201211220102100022 |
4 | 322203223013133313133 |
5 | 1011412210201002401 |
6 | 12320340554022355 |
7 | 563504212433021 |
oct | 72435307376737 |
9 | 15220654812308 |
10 | 4024034000351 |
11 | 1311646317882 |
12 | 54ba74a179bb |
13 | 23260716a811 |
14 | dca9b2aa011 |
15 | 6ea1ae6571b |
hex | 3a8eb1dfddf |
4024034000351 has 2 divisors, whose sum is σ = 4024034000352. Its totient is φ = 4024034000350.
The previous prime is 4024034000347. The next prime is 4024034000353. The reversal of 4024034000351 is 1530004304204.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4024034000351 - 22 = 4024034000347 is a prime.
Together with 4024034000353, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4024034000351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4024034000353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2012017000175 + 2012017000176.
It is an arithmetic number, because the mean of its divisors is an integer number (2012017000176).
Almost surely, 24024034000351 is an apocalyptic number.
4024034000351 is a deficient number, since it is larger than the sum of its proper divisors (1).
4024034000351 is an equidigital number, since it uses as much as digits as its factorization.
4024034000351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 26.
Adding to 4024034000351 its reverse (1530004304204), we get a palindrome (5554038304555).
The spelling of 4024034000351 in words is "four trillion, twenty-four billion, thirty-four million, three hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •