Base | Representation |
---|---|
bin | 111110010010101010000… |
… | …011011101100000010111 |
3 | 120011020002012020020111202 |
4 | 332102222003131200113 |
5 | 1030113222424221243 |
6 | 13034255445023115 |
7 | 621160155365336 |
oct | 76225203354027 |
9 | 16136065206452 |
10 | 4280640460823 |
11 | 1400455a42611 |
12 | 5917499b4a9b |
13 | 25087cb437cc |
14 | 10b281275d1d |
15 | 76538c5e4b8 |
hex | 3e4aa0dd817 |
4280640460823 has 4 divisors (see below), whose sum is σ = 4281006683520. Its totient is φ = 4280274238128.
The previous prime is 4280640460787. The next prime is 4280640460843. The reversal of 4280640460823 is 3280640460824.
4280640460823 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 a cyclic number.
It is not a de Polignac number, because 4280640460823 - 216 = 4280640395287 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 (4280640460843) 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, 183093815 + ... + 183117192.
It is an arithmetic number, because the mean of its divisors is an integer number (1070251670880).
Almost surely, 24280640460823 is an apocalyptic number.
4280640460823 is a deficient number, since it is larger than the sum of its proper divisors (366222697).
4280640460823 is a wasteful number, since it uses less digits than its factorization.
4280640460823 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366222696.
The product of its (nonzero) digits is 1769472, while the sum is 47.
Subtracting from 4280640460823 its reverse (3280640460824), we obtain a palindrome (999999999999).
The spelling of 4280640460823 in words is "four trillion, two hundred eighty billion, six hundred forty million, four hundred sixty thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •