Base | Representation |
---|---|
bin | 1111011001011010… |
… | …0110100001111011 |
3 | 101200001012020221002 |
4 | 3312112212201323 |
5 | 31431034320443 |
6 | 1522043035215 |
7 | 204264640616 |
oct | 36626464173 |
9 | 11601166832 |
10 | 4133120123 |
11 | 1831047360 |
12 | 97420bb0b |
13 | 50b390412 |
14 | 2b2cc717d |
15 | 192cbd2b8 |
hex | f65a687b |
4133120123 has 16 divisors (see below), whose sum is σ = 4535536896. Its totient is φ = 3735222240.
The previous prime is 4133120077. The next prime is 4133120177. The reversal of 4133120123 is 3210213314.
It is a cyclic number.
It is not a de Polignac number, because 4133120123 - 210 = 4133119099 is a prime.
It is a super-2 number, since 2×41331201232 = 34165363902295070258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4133120095 and 4133120104.
It is not an unprimeable number, because it can be changed into a prime (4133120023) 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 15 ways as a sum of consecutive naturals, for example, 1422290 + ... + 1425192.
It is an arithmetic number, because the mean of its divisors is an integer number (283471056).
Almost surely, 24133120123 is an apocalyptic number.
4133120123 is a deficient number, since it is larger than the sum of its proper divisors (402416773).
4133120123 is a wasteful number, since it uses less digits than its factorization.
4133120123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3634.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 4133120123 is about 64289.3468857788. The cubic root of 4133120123 is about 1604.8188216277.
Adding to 4133120123 its reverse (3210213314), we get a palindrome (7343333437).
The spelling of 4133120123 in words is "four billion, one hundred thirty-three million, one hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •