Base | Representation |
---|---|
bin | 1111001000010100… |
… | …0101111001000101 |
3 | 101111001021120101122 |
4 | 3302011011321011 |
5 | 31304210434000 |
6 | 1511002203325 |
7 | 202434336626 |
oct | 36205057105 |
9 | 11431246348 |
10 | 4061421125 |
11 | 17a4625893 |
12 | 9541b3545 |
13 | 4c9578488 |
14 | 2a7581a4d |
15 | 18b859085 |
hex | f2145e45 |
4061421125 has 32 divisors (see below), whose sum is σ = 5381082720. Its totient is φ = 3049881600.
The previous prime is 4061421107. The next prime is 4061421127. The reversal of 4061421125 is 5211241604.
It can be written as a sum of positive squares in 16 ways, for example, as 393665281 + 3667755844 = 19841^2 + 60562^2 .
It is not a de Polignac number, because 4061421125 - 26 = 4061421061 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4061421094 and 4061421103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4061421127) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 866789 + ... + 871461.
It is an arithmetic number, because the mean of its divisors is an integer number (168158835).
Almost surely, 24061421125 is an apocalyptic number.
It is an amenable number.
4061421125 is a deficient number, since it is larger than the sum of its proper divisors (1319661595).
4061421125 is a wasteful number, since it uses less digits than its factorization.
4061421125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5114 (or 5104 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 4061421125 is about 63729.2799661192. The cubic root of 4061421125 is about 1595.4848124795.
Adding to 4061421125 its reverse (5211241604), we get a palindrome (9272662729).
The spelling of 4061421125 in words is "four billion, sixty-one million, four hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •