Base | Representation |
---|---|
bin | 1011101011010011000… |
… | …1101111001110110011 |
3 | 201011210020222122111010 |
4 | 2322310301233032303 |
5 | 11241312431324021 |
6 | 232053252522003 |
7 | 20331043022010 |
oct | 2726461571663 |
9 | 634706878433 |
10 | 200601433011 |
11 | 78090308781 |
12 | 32a65020303 |
13 | 15bbbaca0b5 |
14 | 99cdd1c707 |
15 | 5341176976 |
hex | 2eb4c6f3b3 |
200601433011 has 32 divisors (see below), whose sum is σ = 307850784768. Its totient is φ = 113817600000.
The previous prime is 200601433001. The next prime is 200601433031. The reversal of 200601433011 is 110334106002.
It is not a de Polignac number, because 200601433011 - 25 = 200601432979 is a prime.
It is a super-2 number, since 2×2006014330112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (200601433001) 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 31 ways as a sum of consecutive naturals, for example, 1629886 + ... + 1748636.
It is an arithmetic number, because the mean of its divisors is an integer number (9620337024).
Almost surely, 2200601433011 is an apocalyptic number.
200601433011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200601433011 is a deficient number, since it is larger than the sum of its proper divisors (107249351757).
200601433011 is a wasteful number, since it uses less digits than its factorization.
200601433011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119331.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 200601433011 its reverse (110334106002), we get a palindrome (310935539013).
The spelling of 200601433011 in words is "two hundred billion, six hundred one million, four hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •