Base | Representation |
---|---|
bin | 101110001111110111111100… |
… | …100010011101110110111100 |
3 | 222200011221112122001000002102 |
4 | 232033313330202131312330 |
5 | 203130010223300132200 |
6 | 2000333044133444232 |
7 | 60562144321042013 |
oct | 5617677442356674 |
9 | 880157478030072 |
10 | 203401003130300 |
11 | 5989a976683028 |
12 | 1a9905884a0678 |
13 | 896582b1c2031 |
14 | 3832938003a7a |
15 | 187add82ca6d5 |
hex | b8fdfc89ddbc |
203401003130300 has 18 divisors (see below), whose sum is σ = 441380176792968. Its totient is φ = 81360401252080.
The previous prime is 203401003130243. The next prime is 203401003130327. The reversal of 203401003130300 is 3031300104302.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 1017005015552 + ... + 1017005015751.
Almost surely, 2203401003130300 is an apocalyptic number.
203401003130300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
203401003130300 is an abundant number, since it is smaller than the sum of its proper divisors (237979173662668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203401003130300 is a wasteful number, since it uses less digits than its factorization.
203401003130300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2034010031317 (or 2034010031310 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 203401003130300 its reverse (3031300104302), we get a palindrome (206432303234602).
The spelling of 203401003130300 in words is "two hundred three trillion, four hundred one billion, three million, one hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •