Base | Representation |
---|---|
bin | 11110100000000101011100… |
… | …011111101011101001000111 |
3 | 122120222020221212210101120001 |
4 | 132200011130133223221013 |
5 | 120040323022413140223 |
6 | 1153145535450222131 |
7 | 40153514336620420 |
oct | 3640053437535107 |
9 | 576866855711501 |
10 | 134146265365063 |
11 | 3981a125681496 |
12 | 13066540a24947 |
13 | 59b0c27ca08c3 |
14 | 251a9dcc94647 |
15 | 10796bb3299ad |
hex | 7a015c7eba47 |
134146265365063 has 16 divisors (see below), whose sum is σ = 153547352073216. Its totient is φ = 114804518156640.
The previous prime is 134146265365051. The next prime is 134146265365069. The reversal of 134146265365063 is 360563562641431.
It is a cyclic number.
It is not a de Polignac number, because 134146265365063 - 221 = 134146263267911 is a prime.
It is a super-2 number, since 2×1341462653650632 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134146265364995 and 134146265365013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134146265365069) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320322978 + ... + 320741488.
It is an arithmetic number, because the mean of its divisors is an integer number (9596709504576).
Almost surely, 2134146265365063 is an apocalyptic number.
134146265365063 is a deficient number, since it is larger than the sum of its proper divisors (19401086708153).
134146265365063 is an equidigital number, since it uses as much as digits as its factorization.
134146265365063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489294.
The product of its (nonzero) digits is 27993600, while the sum is 55.
The spelling of 134146265365063 in words is "one hundred thirty-four trillion, one hundred forty-six billion, two hundred sixty-five million, three hundred sixty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •