Base | Representation |
---|---|
bin | 11010100100010010… |
… | …01110001100100101 |
3 | 1100211000110001202211 |
4 | 31102021032030211 |
5 | 213202320113140 |
6 | 10315150403421 |
7 | 1013310635125 |
oct | 152211161445 |
9 | 40730401684 |
10 | 14263051045 |
11 | 605a1363a1 |
12 | 2920800571 |
13 | 1463c70a99 |
14 | 9943ccc85 |
15 | 5872942ea |
hex | 35224e325 |
14263051045 has 8 divisors (see below), whose sum is σ = 17121081240. Its totient is φ = 11406827520.
The previous prime is 14263051007. The next prime is 14263051069. The reversal of 14263051045 is 54015036241.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 7226190049 + 7036860996 = 85007^2 + 83886^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14263051045 - 211 = 14263048997 is a prime.
It is a super-2 number, since 2×142630510452 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14263050998 and 14263051016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 434236 + ... + 465925.
It is an arithmetic number, because the mean of its divisors is an integer number (2140135155).
Almost surely, 214263051045 is an apocalyptic number.
It is an amenable number.
14263051045 is a deficient number, since it is larger than the sum of its proper divisors (2858030195).
14263051045 is an equidigital number, since it uses as much as digits as its factorization.
14263051045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 903335.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 14263051045 its reverse (54015036241), we get a palindrome (68278087286).
The spelling of 14263051045 in words is "fourteen billion, two hundred sixty-three million, fifty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •