Base | Representation |
---|---|
bin | 110000001110101101111100… |
… | …0000111111101101101000111 |
3 | 2001122002111100212101020221111 |
4 | 1200131123320013331231013 |
5 | 421101132304202014143 |
6 | 4102134553351425451 |
7 | 155233662200340346 |
oct | 14035337007755507 |
9 | 2048074325336844 |
10 | 424235262532423 |
11 | 1131a11899aaa81 |
12 | 3b6b7777085287 |
13 | 152942a137cb84 |
14 | 76a914c211b5d |
15 | 340a4ed03199d |
hex | 181d6f81fdb47 |
424235262532423 has 4 divisors (see below), whose sum is σ = 424877070797128. Its totient is φ = 423593454267720.
The previous prime is 424235262532337. The next prime is 424235262532493. The reversal of 424235262532423 is 324235262532424.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-424235262532423 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424235262532493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 320904131361 + ... + 320904132682.
It is an arithmetic number, because the mean of its divisors is an integer number (106219267699282).
Almost surely, 2424235262532423 is an apocalyptic number.
424235262532423 is a deficient number, since it is larger than the sum of its proper divisors (641808264705).
424235262532423 is an equidigital number, since it uses as much as digits as its factorization.
424235262532423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641808264704.
The product of its digits is 16588800, while the sum is 49.
Subtracting from 424235262532423 its reverse (324235262532424), we obtain a palindrome (99999999999999).
The spelling of 424235262532423 in words is "four hundred twenty-four trillion, two hundred thirty-five billion, two hundred sixty-two million, five hundred thirty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.305 sec. • engine limits •