Base | Representation |
---|---|
bin | 1101010000101100110011… |
… | …0011000001010000000101 |
3 | 1220121212221221110001200202 |
4 | 3110023030303001100011 |
5 | 3402341434030213112 |
6 | 51002114154020245 |
7 | 3033260513003000 |
oct | 324131463012005 |
9 | 56555857401622 |
10 | 14580554929157 |
11 | 47116401636a8 |
12 | 1775986417685 |
13 | 819c2c181779 |
14 | 3859ba000537 |
15 | 1a4418ab86c2 |
hex | d42cccc1405 |
14580554929157 has 8 divisors (see below), whose sum is σ = 17003562600000. Its totient is φ = 12497618510412.
The previous prime is 14580554929111. The next prime is 14580554929177. The reversal of 14580554929157 is 75192945508541.
It is not a de Polignac number, because 14580554929157 - 212 = 14580554925061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14580554929093 and 14580554929102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14580554929177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21254452907 + ... + 21254453592.
It is an arithmetic number, because the mean of its divisors is an integer number (2125445325000).
Almost surely, 214580554929157 is an apocalyptic number.
It is an amenable number.
14580554929157 is a deficient number, since it is larger than the sum of its proper divisors (2423007670843).
14580554929157 is an frugal number, since it uses more digits than its factorization.
14580554929157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42508906520 (or 42508906506 counting only the distinct ones).
The product of its (nonzero) digits is 90720000, while the sum is 65.
The spelling of 14580554929157 in words is "fourteen trillion, five hundred eighty billion, five hundred fifty-four million, nine hundred twenty-nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •