Base | Representation |
---|---|
bin | 11010010100001110… |
… | …11011000011011111 |
3 | 1100110122000010201101 |
4 | 31022013123003133 |
5 | 212413330033240 |
6 | 10253535453531 |
7 | 1010054043610 |
oct | 151207330337 |
9 | 40418003641 |
10 | 14128361695 |
11 | 5aa0101288 |
12 | 28a36872a7 |
13 | 14420a2a46 |
14 | 98056bc07 |
15 | 57a53b39a |
hex | 34a1db0df |
14128361695 has 16 divisors (see below), whose sum is σ = 19402725888. Its totient is φ = 9674676000.
The previous prime is 14128361671. The next prime is 14128361699. The reversal of 14128361695 is 59616382141.
It is not a de Polignac number, because 14128361695 - 27 = 14128361567 is a prime.
It is a super-2 number, since 2×141283616952 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14128361699) 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 15 ways as a sum of consecutive naturals, for example, 252181 + ... + 303070.
It is an arithmetic number, because the mean of its divisors is an integer number (1212670368).
Almost surely, 214128361695 is an apocalyptic number.
14128361695 is a deficient number, since it is larger than the sum of its proper divisors (5274364193).
14128361695 is an equidigital number, since it uses as much as digits as its factorization.
14128361695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555990.
The product of its digits is 311040, while the sum is 46.
The spelling of 14128361695 in words is "fourteen billion, one hundred twenty-eight million, three hundred sixty-one thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •