Base | Representation |
---|---|
bin | 1100110111000011… |
… | …0111101110000111 |
3 | 22220120210220101201 |
4 | 3031300313232013 |
5 | 24032221443143 |
6 | 1330315203331 |
7 | 151355465224 |
oct | 31560675607 |
9 | 8816726351 |
10 | 3452140423 |
11 | 1511709216 |
12 | 804146547 |
13 | 430280554 |
14 | 24a6a094b |
15 | 15310664d |
hex | cdc37b87 |
3452140423 has 2 divisors, whose sum is σ = 3452140424. Its totient is φ = 3452140422.
The previous prime is 3452140387. The next prime is 3452140493. The reversal of 3452140423 is 3240412543.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3452140423 - 221 = 3450043271 is a prime.
It is a super-2 number, since 2×34521404232 = 23834547000221237858, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3452140391 and 3452140400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3452140493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1726070211 + 1726070212.
It is an arithmetic number, because the mean of its divisors is an integer number (1726070212).
Almost surely, 23452140423 is an apocalyptic number.
3452140423 is a deficient number, since it is larger than the sum of its proper divisors (1).
3452140423 is an equidigital number, since it uses as much as digits as its factorization.
3452140423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 28.
The square root of 3452140423 is about 58754.9182877485. The cubic root of 3452140423 is about 1511.3422305180.
Adding to 3452140423 its reverse (3240412543), we get a palindrome (6692552966).
The spelling of 3452140423 in words is "three billion, four hundred fifty-two million, one hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •