Base | Representation |
---|---|
bin | 1011110110111110000… |
… | …1000100110000100101 |
3 | 201110212121020001220121 |
4 | 2331233201010300211 |
5 | 11314222001413013 |
6 | 233332211201541 |
7 | 20501504601421 |
oct | 2755741046045 |
9 | 643777201817 |
10 | 203734404133 |
11 | 7944883a307 |
12 | 3359a2a62b1 |
13 | 1629abca570 |
14 | 9c0a059b81 |
15 | 547623458d |
hex | 2f6f844c25 |
203734404133 has 16 divisors (see below), whose sum is σ = 233265432960. Its totient is φ = 176491808064.
The previous prime is 203734404131. The next prime is 203734404151. The reversal of 203734404133 is 331404437302.
203734404133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 203734404133 - 21 = 203734404131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203734404131) 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, 6412323 + ... + 6444016.
It is an arithmetic number, because the mean of its divisors is an integer number (14579089560).
Almost surely, 2203734404133 is an apocalyptic number.
203734404133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
203734404133 is a deficient number, since it is larger than the sum of its proper divisors (29531028827).
203734404133 is a wasteful number, since it uses less digits than its factorization.
203734404133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12856428.
The product of its (nonzero) digits is 72576, while the sum is 34.
The spelling of 203734404133 in words is "two hundred three billion, seven hundred thirty-four million, four hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •