Base | Representation |
---|---|
bin | 111110011001111000… |
… | …0110110111101001011 |
3 | 110210220120000220211221 |
4 | 1330303300312331023 |
5 | 4143424140312303 |
6 | 141321531302511 |
7 | 12452644610266 |
oct | 1746360667513 |
9 | 423816026757 |
10 | 134012432203 |
11 | 5191a584901 |
12 | 21b805aaa37 |
13 | c839259b80 |
14 | 66b4337cdd |
15 | 37452424bd |
hex | 1f33c36f4b |
134012432203 has 8 divisors (see below), whose sum is σ = 144496452128. Its totient is φ = 123553465344.
The previous prime is 134012432189. The next prime is 134012432219. The reversal of 134012432203 is 302234210431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134012432203 - 225 = 133978877771 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134012462203) 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 7 ways as a sum of consecutive naturals, for example, 6252150 + ... + 6273547.
It is an arithmetic number, because the mean of its divisors is an integer number (18062056516).
Almost surely, 2134012432203 is an apocalyptic number.
134012432203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
134012432203 is a deficient number, since it is larger than the sum of its proper divisors (10484019925).
134012432203 is a wasteful number, since it uses less digits than its factorization.
134012432203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12526533.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 134012432203 its reverse (302234210431), we get a palindrome (436246642634).
The spelling of 134012432203 in words is "one hundred thirty-four billion, twelve million, four hundred thirty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •