Base | Representation |
---|---|
bin | 1101001101111010011000… |
… | …0110010111110001010111 |
3 | 1220110022100010122221100102 |
4 | 3103132212012113301113 |
5 | 3401100342212103310 |
6 | 50524113510004315 |
7 | 3026643613520402 |
oct | 323364606276127 |
9 | 56408303587312 |
10 | 14532661050455 |
11 | 46a32a332a769 |
12 | 176863a94669b |
13 | 815568863b82 |
14 | 3835552b0d39 |
15 | 1a30640998a5 |
hex | d37a6197c57 |
14532661050455 has 8 divisors (see below), whose sum is σ = 17810239925952. Its totient is φ = 11378764396768.
The previous prime is 14532661050449. The next prime is 14532661050497. The reversal of 14532661050455 is 55405016623541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-14532661050455 is a prime.
It is a super-2 number, since 2×145326610504552 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
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, 30920555192 + ... + 30920555661.
It is an arithmetic number, because the mean of its divisors is an integer number (2226279990744).
Almost surely, 214532661050455 is an apocalyptic number.
14532661050455 is a deficient number, since it is larger than the sum of its proper divisors (3277578875497).
14532661050455 is an equidigital number, since it uses as much as digits as its factorization.
14532661050455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61841110905.
The product of its (nonzero) digits is 2160000, while the sum is 47.
Adding to 14532661050455 its reverse (55405016623541), we get a palindrome (69937677673996).
The spelling of 14532661050455 in words is "fourteen trillion, five hundred thirty-two billion, six hundred sixty-one million, fifty thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •