Base | Representation |
---|---|
bin | 11011111110010100101111… |
… | …011001111110001101101101 |
3 | 121010121120021112121022112211 |
4 | 123332110233121332031231 |
5 | 112111211203141002001 |
6 | 1113355132454330421 |
7 | 34625430254216620 |
oct | 3376245731761555 |
9 | 533546245538484 |
10 | 123030133531501 |
11 | 36223871a98129 |
12 | 11970092959a11 |
13 | 53858cbba5991 |
14 | 225499400ddb7 |
15 | e3546959d351 |
hex | 6fe52f67e36d |
123030133531501 has 16 divisors (see below), whose sum is σ = 140653182983040. Its totient is φ = 105418915430400.
The previous prime is 123030133531499. The next prime is 123030133531519. The reversal of 123030133531501 is 105135331030321.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 123030133531501 - 21 = 123030133531499 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123030133531541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 783298426 + ... + 783455476.
It is an arithmetic number, because the mean of its divisors is an integer number (8790823936440).
Almost surely, 2123030133531501 is an apocalyptic number.
It is an amenable number.
123030133531501 is a deficient number, since it is larger than the sum of its proper divisors (17623049451539).
123030133531501 is a wasteful number, since it uses less digits than its factorization.
123030133531501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194004.
The product of its (nonzero) digits is 12150, while the sum is 31.
Adding to 123030133531501 its reverse (105135331030321), we get a palindrome (228165464561822).
The spelling of 123030133531501 in words is "one hundred twenty-three trillion, thirty billion, one hundred thirty-three million, five hundred thirty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •