Base | Representation |
---|---|
bin | 11010100010010111… |
… | …10100111011001110 |
3 | 1100202220011101112211 |
4 | 31101023310323032 |
5 | 213134210104000 |
6 | 10313413421034 |
7 | 1013024064025 |
oct | 152113647316 |
9 | 40686141484 |
10 | 14246956750 |
11 | 6051043524 |
12 | 291733a77a |
13 | 1460827330 |
14 | 9921dd8bc |
15 | 585b657ba |
hex | 3512f4ece |
14246956750 has 128 divisors (see below), whose sum is σ = 30380313600. Its totient is φ = 4965120000.
The previous prime is 14246956739. The next prime is 14246956753. The reversal of 14246956750 is 5765964241.
It is a super-3 number, since 3×142469567503 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14246956694 and 14246956703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14246956753) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 4129026 + ... + 4132474.
It is an arithmetic number, because the mean of its divisors is an integer number (237346200).
Almost surely, 214246956750 is an apocalyptic number.
14246956750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14246956750 is an abundant number, since it is smaller than the sum of its proper divisors (16133356850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14246956750 is a wasteful number, since it uses less digits than its factorization.
14246956750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3551 (or 3541 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 14246956750 in words is "fourteen billion, two hundred forty-six million, nine hundred fifty-six thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •