Base | Representation |
---|---|
bin | 1101101010101… |
… | …01000011100100 |
3 | 21222201110212102 |
4 | 12311111003210 |
5 | 213322040142 |
6 | 15213111232 |
7 | 2561310440 |
oct | 665250344 |
9 | 258643772 |
10 | 114643172 |
11 | 59793126 |
12 | 32488518 |
13 | 1a99c8c7 |
14 | 11323820 |
15 | a0e8532 |
hex | 6d550e4 |
114643172 has 48 divisors (see below), whose sum is σ = 244073088. Its totient is φ = 45995520.
The previous prime is 114643171. The next prime is 114643219. The reversal of 114643172 is 271346411.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (114643171) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 107522 + ... + 108582.
It is an arithmetic number, because the mean of its divisors is an integer number (5084856).
Almost surely, 2114643172 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114643172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122036544).
114643172 is an abundant number, since it is smaller than the sum of its proper divisors (129429916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114643172 is a wasteful number, since it uses less digits than its factorization.
114643172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316 (or 1314 counting only the distinct ones).
The product of its digits is 4032, while the sum is 29.
The square root of 114643172 is about 10707.1551777305. The cubic root of 114643172 is about 485.7909254416.
Adding to 114643172 its reverse (271346411), we get a palindrome (385989583).
The spelling of 114643172 in words is "one hundred fourteen million, six hundred forty-three thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •