Base | Representation |
---|---|
bin | 10000011101100111100… |
… | …000100110111100001000 |
3 | 11000011010010222222202220 |
4 | 100131213200212330020 |
5 | 122013412112001300 |
6 | 2223415031454040 |
7 | 144506663560215 |
oct | 20354740467410 |
9 | 4004103888686 |
10 | 1131313000200 |
11 | 3a6872771559 |
12 | 16330a527320 |
13 | 828b41aa666 |
14 | 3ca82058b0c |
15 | 1e6649d6da0 |
hex | 10767826f08 |
1131313000200 has 48 divisors (see below), whose sum is σ = 3507070302480. Its totient is φ = 301683466560.
The previous prime is 1131313000199. The next prime is 1131313000211. The reversal of 1131313000200 is 20003131311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1131313000200.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 942760234 + ... + 942761433.
It is an arithmetic number, because the mean of its divisors is an integer number (73063964635).
Almost surely, 21131313000200 is an apocalyptic number.
1131313000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1131313000200 is an abundant number, since it is smaller than the sum of its proper divisors (2375757302280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131313000200 is a wasteful number, since it uses less digits than its factorization.
1131313000200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1885521686 (or 1885521677 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1131313000200 its reverse (20003131311), we get a palindrome (1151316131511).
The spelling of 1131313000200 in words is "one trillion, one hundred thirty-one billion, three hundred thirteen million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •