Base | Representation |
---|---|
bin | 1111010111101000… |
… | …0111101000100111 |
3 | 101122112010220201002 |
4 | 3311322013220213 |
5 | 31422131403133 |
6 | 1521215023515 |
7 | 204144322304 |
oct | 36572075047 |
9 | 11575126632 |
10 | 4125653543 |
11 | 1827907630 |
12 | 97180ab9b |
13 | 509977a1b |
14 | 2b1d020ab |
15 | 1922e5ce8 |
hex | f5e87a27 |
4125653543 has 12 divisors (see below), whose sum is σ = 4704910728. Its totient is φ = 3587519760.
The previous prime is 4125653531. The next prime is 4125653549. The reversal of 4125653543 is 3453565214.
4125653543 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4125653543 - 224 = 4108876327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4125653497 and 4125653506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4125653549) 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 in 11 ways as a sum of consecutive naturals, for example, 348680 + ... + 360317.
It is an arithmetic number, because the mean of its divisors is an integer number (392075894).
Almost surely, 24125653543 is an apocalyptic number.
4125653543 is a deficient number, since it is larger than the sum of its proper divisors (579257185).
4125653543 is a wasteful number, since it uses less digits than its factorization.
4125653543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709054 (or 709031 counting only the distinct ones).
The product of its digits is 216000, while the sum is 38.
The square root of 4125653543 is about 64231.2505171743. The cubic root of 4125653543 is about 1603.8518579640.
The spelling of 4125653543 in words is "four billion, one hundred twenty-five million, six hundred fifty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •