Base | Representation |
---|---|
bin | 11010001010111011… |
… | …01011100000001000 |
3 | 1100021012010201010111 |
4 | 31011131223200020 |
5 | 212233334411102 |
6 | 10242110524104 |
7 | 1005115444234 |
oct | 150535534010 |
9 | 40235121114 |
10 | 14050310152 |
11 | 5a60040a7a |
12 | 2881506634 |
13 | 142bb754b8 |
14 | 9740515c4 |
15 | 57376ecd7 |
hex | 34576b808 |
14050310152 has 64 divisors (see below), whose sum is σ = 28191240000. Its totient is φ = 6545836800.
The previous prime is 14050310149. The next prime is 14050310167. The reversal of 14050310152 is 25101305041.
It is a happy number.
It is a super-2 number, since 2×140503101522 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2299902 + ... + 2306002.
It is an arithmetic number, because the mean of its divisors is an integer number (440488125).
Almost surely, 214050310152 is an apocalyptic number.
It is an amenable number.
14050310152 is an abundant number, since it is smaller than the sum of its proper divisors (14140929848).
14050310152 is a wasteful number, since it uses less digits than its factorization.
14050310152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6374 (or 6370 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
Adding to 14050310152 its reverse (25101305041), we get a palindrome (39151615193).
The spelling of 14050310152 in words is "fourteen billion, fifty million, three hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •