Base | Representation |
---|---|
bin | 1100110110001100010000… |
… | …0001101001010111001010 |
3 | 1212000100110101020101000111 |
4 | 3031203010001221113022 |
5 | 3322411242124011041 |
6 | 50013000022024534 |
7 | 2655336111323524 |
oct | 315430401512712 |
9 | 55010411211014 |
10 | 14125141235146 |
11 | 4556490a92877 |
12 | 170166927814a |
13 | 7b5cc231a496 |
14 | 36b93651ca14 |
15 | 197662407981 |
hex | cd8c40695ca |
14125141235146 has 8 divisors (see below), whose sum is σ = 21223441554084. Its totient is φ = 7050660717120.
The previous prime is 14125141235111. The next prime is 14125141235167. The reversal of 14125141235146 is 64153214152141.
It can be written as a sum of positive squares in 2 ways, for example, as 12762577625625 + 1362563609521 = 3572475^2 + 1167289^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×141251412351462 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14125141235099 and 14125141235108.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5954948745 + ... + 5954951116.
Almost surely, 214125141235146 is an apocalyptic number.
14125141235146 is a deficient number, since it is larger than the sum of its proper divisors (7098300318938).
14125141235146 is a wasteful number, since it uses less digits than its factorization.
14125141235146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11909900456.
The product of its digits is 115200, while the sum is 40.
Adding to 14125141235146 its reverse (64153214152141), we get a palindrome (78278355387287).
The spelling of 14125141235146 in words is "fourteen trillion, one hundred twenty-five billion, one hundred forty-one million, two hundred thirty-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •