Base | Representation |
---|---|
bin | 1101101100111… |
… | …10111110100001 |
3 | 22000021212012112 |
4 | 12312132332201 |
5 | 213411232303 |
6 | 15223405105 |
7 | 2564011253 |
oct | 666367641 |
9 | 260255175 |
10 | 114945953 |
11 | 5997a661 |
12 | 325b3795 |
13 | 1aa77675 |
14 | 113a1cd3 |
15 | a1580d8 |
hex | 6d9efa1 |
114945953 has 8 divisors (see below), whose sum is σ = 122455200. Its totient is φ = 107582688.
The previous prime is 114945907. The next prime is 114945967. The reversal of 114945953 is 359549411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114945953 - 26 = 114945889 is a prime.
It is a super-2 number, since 2×1149459532 = 26425144222156418, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114945953.
It is not an unprimeable number, because it can be changed into a prime (114947953) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 34868 + ... + 38021.
It is an arithmetic number, because the mean of its divisors is an integer number (15306900).
Almost surely, 2114945953 is an apocalyptic number.
It is an amenable number.
114945953 is a deficient number, since it is larger than the sum of its proper divisors (7509247).
114945953 is an equidigital number, since it uses as much as digits as its factorization.
114945953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72991.
The product of its digits is 97200, while the sum is 41.
The square root of 114945953 is about 10721.2850442473. The cubic root of 114945953 is about 486.2182192757.
The spelling of 114945953 in words is "one hundred fourteen million, nine hundred forty-five thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •