Base | Representation |
---|---|
bin | 110011001111110001… |
… | …1010000001011011010 |
3 | 101112001122101002122212 |
4 | 1212133203100023122 |
5 | 3300341024013200 |
6 | 122320130515122 |
7 | 10644111034364 |
oct | 1463743201332 |
9 | 345048332585 |
10 | 110051001050 |
11 | 42743a14a41 |
12 | 193b3a35aa2 |
13 | a4bac45b43 |
14 | 547dc9bd34 |
15 | 2ce181e035 |
hex | 199f8d02da |
110051001050 has 24 divisors (see below), whose sum is σ = 215468277600. Its totient is φ = 41703536880.
The previous prime is 110051001041. The next prime is 110051001089. The reversal of 110051001050 is 50100150011.
It is a super-2 number, since 2×1100510010502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 57920630 + ... + 57922529.
It is an arithmetic number, because the mean of its divisors is an integer number (8977844900).
Almost surely, 2110051001050 is an apocalyptic number.
110051001050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110051001050 is a deficient number, since it is larger than the sum of its proper divisors (105417276550).
110051001050 is a wasteful number, since it uses less digits than its factorization.
110051001050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115843190 (or 115843185 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 14.
Adding to 110051001050 its reverse (50100150011), we get a palindrome (160151151061).
The spelling of 110051001050 in words is "one hundred ten billion, fifty-one million, one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •