Base | Representation |
---|---|
bin | 111100010001011… |
… | …011000000110010 |
3 | 2121110202021200201 |
4 | 330101123000302 |
5 | 4032331400200 |
6 | 244201305414 |
7 | 34026026050 |
oct | 7421330062 |
9 | 2543667621 |
10 | 1011200050 |
11 | 479883623 |
12 | 24279526a |
13 | 13165c033 |
14 | 984251d0 |
15 | 5db94c6a |
hex | 3c45b032 |
1011200050 has 48 divisors (see below), whose sum is σ = 2184806592. Its totient is φ = 341006400.
The previous prime is 1011200041. The next prime is 1011200077. The reversal of 1011200050 is 500021101.
It is a happy number.
It is a super-2 number, since 2×10112000502 = 2045051082240005000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2332 + ... + 45031.
It is an arithmetic number, because the mean of its divisors is an integer number (45516804).
Almost surely, 21011200050 is an apocalyptic number.
1011200050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011200050 is an abundant number, since it is smaller than the sum of its proper divisors (1173606542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011200050 is a wasteful number, since it uses less digits than its factorization.
1011200050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47443 (or 47438 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 10.
The square root of 1011200050 is about 31799.3718491419. The cubic root of 1011200050 is about 1003.7194981806.
Adding to 1011200050 its reverse (500021101), we get a palindrome (1511221151).
The spelling of 1011200050 in words is "one billion, eleven million, two hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •