Base | Representation |
---|---|
bin | 1101101110111… |
… | …11110011000100 |
3 | 22000210100102010 |
4 | 12313133303010 |
5 | 213443231320 |
6 | 15233214220 |
7 | 2566165320 |
oct | 667376304 |
9 | 260710363 |
10 | 115211460 |
11 | 5a041091 |
12 | 32701370 |
13 | 1ab3b480 |
14 | 11430980 |
15 | a1abae0 |
hex | 6ddfcc4 |
115211460 has 96 divisors (see below), whose sum is σ = 397055232. Its totient is φ = 24307200.
The previous prime is 115211449. The next prime is 115211477. The reversal of 115211460 is 64112511.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 31 ways as a sum of consecutive naturals, for example, 5091 + ... + 16010.
It is an arithmetic number, because the mean of its divisors is an integer number (4135992).
Almost surely, 2115211460 is an apocalyptic number.
115211460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115211460 is an abundant number, since it is smaller than the sum of its proper divisors (281843772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115211460 is a wasteful number, since it uses less digits than its factorization.
115211460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21133 (or 21131 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 115211460 is about 10733.6601399523. The cubic root of 115211460 is about 486.5922938412.
Adding to 115211460 its reverse (64112511), we get a palindrome (179323971).
It can be divided in two parts, 115 and 211460, that added together give a triangular number (211575 = T650).
The spelling of 115211460 in words is "one hundred fifteen million, two hundred eleven thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •