Base | Representation |
---|---|
bin | 111110111101011001… |
… | …0011010101101010011 |
3 | 110220222121020000021222 |
4 | 1331322302122231103 |
5 | 4203344212214443 |
6 | 142040055235255 |
7 | 12524324143301 |
oct | 1757262325523 |
9 | 426877200258 |
10 | 135204023123 |
11 | 52381167794 |
12 | 22253678b2b |
13 | c999098960 |
14 | 67886b9271 |
15 | 37b4b6b468 |
hex | 1f7ac9ab53 |
135204023123 has 16 divisors (see below), whose sum is σ = 153520389120. Its totient is φ = 118040180256.
The previous prime is 135204023117. The next prime is 135204023153. The reversal of 135204023123 is 321320402531.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 135204023123 - 210 = 135204022099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135204023092 and 135204023101.
It is not an unprimeable number, because it can be changed into a prime (135204023153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 300965 + ... + 600822.
It is an arithmetic number, because the mean of its divisors is an integer number (9595024320).
Almost surely, 2135204023123 is an apocalyptic number.
135204023123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
135204023123 is a deficient number, since it is larger than the sum of its proper divisors (18316365997).
135204023123 is a wasteful number, since it uses less digits than its factorization.
135204023123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902426.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 135204023123 its reverse (321320402531), we get a palindrome (456524425654).
The spelling of 135204023123 in words is "one hundred thirty-five billion, two hundred four million, twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •