Base | Representation |
---|---|
bin | 101111001001101101011… |
… | …000010001011001000111 |
3 | 102110202121221000010021010 |
4 | 233021231120101121013 |
5 | 411042003021423143 |
6 | 10520313525253303 |
7 | 453046115065056 |
oct | 57115530213107 |
9 | 12422557003233 |
10 | 3240240420423 |
11 | 103a1a6276386 |
12 | 443b91b64233 |
13 | 1a672696b926 |
14 | b2b8548a39d |
15 | 59445840a33 |
hex | 2f26d611647 |
3240240420423 has 4 divisors (see below), whose sum is σ = 4320320560568. Its totient is φ = 2160160280280.
The previous prime is 3240240420397. The next prime is 3240240420433.
3240240420423 is nontrivially palindromic in base 10.
3240240420423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3240240420423 - 221 = 3240238323271 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 (3240240420433) 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, 540040070068 + ... + 540040070073.
It is an arithmetic number, because the mean of its divisors is an integer number (1080080140142).
Almost surely, 23240240420423 is an apocalyptic number.
3240240420423 is a deficient number, since it is larger than the sum of its proper divisors (1080080140145).
3240240420423 is a wasteful number, since it uses less digits than its factorization.
3240240420423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1080080140144.
The product of its (nonzero) digits is 36864, while the sum is 30.
It can be divided in two parts, 3240240 and 420423, that added together give a palindrome (3660663).
The spelling of 3240240420423 in words is "three trillion, two hundred forty billion, two hundred forty million, four hundred twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •