Base | Representation |
---|---|
bin | 101101011111111000100010… |
… | …111110000011000010000100 |
3 | 222020111200002222221202120010 |
4 | 231133320202332003002010 |
5 | 202211442133412330312 |
6 | 1545330033455110220 |
7 | 60101654452412016 |
oct | 5537704276030204 |
9 | 866450088852503 |
10 | 200103113011332 |
11 | 58839287687993 |
12 | 1a5393a7812370 |
13 | 8786847a00a5b |
14 | 375b0842a81b6 |
15 | 182021b74293c |
hex | b5fe22f83084 |
200103113011332 has 48 divisors (see below), whose sum is σ = 466963655961600. Its totient is φ = 66692982264480.
The previous prime is 200103113011297. The next prime is 200103113011379. The reversal of 200103113011332 is 233110311301002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200103113011299 and 200103113011308.
It is an unprimeable number.
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, 5584618657 + ... + 5584654487.
It is an arithmetic number, because the mean of its divisors is an integer number (9728409499200).
Almost surely, 2200103113011332 is an apocalyptic number.
It is an amenable number.
200103113011332 is an abundant number, since it is smaller than the sum of its proper divisors (266860542950268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200103113011332 is a wasteful number, since it uses less digits than its factorization.
200103113011332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79056 (or 79054 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 200103113011332 its reverse (233110311301002), we get a palindrome (433213424312334).
The spelling of 200103113011332 in words is "two hundred trillion, one hundred three billion, one hundred thirteen million, eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •