Base | Representation |
---|---|
bin | 11011000010000111… |
… | …11101110010011000 |
3 | 1101110110101121210211 |
4 | 31201003331302120 |
5 | 214210403100402 |
6 | 10400051020504 |
7 | 1022440165252 |
oct | 154103756230 |
9 | 41413347724 |
10 | 14513331352 |
11 | 6178440723 |
12 | 299059a734 |
13 | 14a3a80c40 |
14 | 9b973ccd2 |
15 | 59e2314d7 |
hex | 3610fdc98 |
14513331352 has 16 divisors (see below), whose sum is σ = 29305765440. Its totient is φ = 6698460576.
The previous prime is 14513331337. The next prime is 14513331379. The reversal of 14513331352 is 25313331541.
It is a happy number.
14513331352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×145133313522 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 69775528 + ... + 69775735.
It is an arithmetic number, because the mean of its divisors is an integer number (1831610340).
Almost surely, 214513331352 is an apocalyptic number.
It is an amenable number.
14513331352 is an abundant number, since it is smaller than the sum of its proper divisors (14792434088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14513331352 is a wasteful number, since it uses less digits than its factorization.
14513331352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139551282 (or 139551278 counting only the distinct ones).
The product of its digits is 16200, while the sum is 31.
Adding to 14513331352 its reverse (25313331541), we get a palindrome (39826662893).
The spelling of 14513331352 in words is "fourteen billion, five hundred thirteen million, three hundred thirty-one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •