Base | Representation |
---|---|
bin | 11010100010101101… |
… | …00010011110010110 |
3 | 1100210002110001102010 |
4 | 31101112202132112 |
5 | 213140414433013 |
6 | 10313553525050 |
7 | 1013060000445 |
oct | 152126423626 |
9 | 40702401363 |
10 | 14249764758 |
11 | 6052691199 |
12 | 2918273786 |
13 | 146129b488 |
14 | 992730d5c |
15 | 58601c7c3 |
hex | 3515a2796 |
14249764758 has 64 divisors (see below), whose sum is σ = 29831239872. Its totient is φ = 4533534720.
The previous prime is 14249764741. The next prime is 14249764759. The reversal of 14249764758 is 85746794241.
14249764758 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14249764698 and 14249764707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14249764759) 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 31 ways as a sum of consecutive naturals, for example, 5174710 + ... + 5177462.
It is an arithmetic number, because the mean of its divisors is an integer number (466113123).
Almost surely, 214249764758 is an apocalyptic number.
14249764758 is an abundant number, since it is smaller than the sum of its proper divisors (15581475114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14249764758 is a wasteful number, since it uses less digits than its factorization.
14249764758 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3249.
The product of its digits is 13547520, while the sum is 57.
The spelling of 14249764758 in words is "fourteen billion, two hundred forty-nine million, seven hundred sixty-four thousand, seven hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •