Base | Representation |
---|---|
bin | 110101000110011001… |
… | …0111100000011001100 |
3 | 101220100001000220022200 |
4 | 1222030302330003030 |
5 | 3332014004004400 |
6 | 124215114441500 |
7 | 11144542111605 |
oct | 1521462740314 |
9 | 356301026280 |
10 | 114031313100 |
11 | 443a6781331 |
12 | 1a124a33290 |
13 | a9a3763183 |
14 | 573a768dac |
15 | 2e75ea5b00 |
hex | 1a8ccbc0cc |
114031313100 has 108 divisors (see below), whose sum is σ = 378449855784. Its totient is φ = 28619619840.
The previous prime is 114031313069. The next prime is 114031313111. The reversal of 114031313100 is 1313130411.
114031313100 is a `hidden beast` number, since 1 + 1 + 40 + 313 + 1 + 310 + 0 = 666.
It is a super-2 number, since 2×1140313131002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3711214 + ... + 3741813.
Almost surely, 2114031313100 is an apocalyptic number.
114031313100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114031313100 is an abundant number, since it is smaller than the sum of its proper divisors (264418542684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114031313100 is a wasteful number, since it uses less digits than its factorization.
114031313100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7453064 (or 7453054 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 114031313100 its reverse (1313130411), we get a palindrome (115344443511).
The spelling of 114031313100 in words is "one hundred fourteen billion, thirty-one million, three hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •