Base | Representation |
---|---|
bin | 101000011010101000000010… |
… | …0110101011001001011010101 |
3 | 1201121201202200021012220002202 |
4 | 1100311100010311121023111 |
5 | 333044030334204131013 |
6 | 3300031513120014245 |
7 | 134611152401421434 |
oct | 12065200465311325 |
9 | 1647652607186082 |
10 | 355503114130133 |
11 | a3302029a85632 |
12 | 33a56a75761385 |
13 | 12349a52271568 |
14 | 63b062a44111b |
15 | 2b176b9e0d858 |
hex | 1435404d592d5 |
355503114130133 has 8 divisors (see below), whose sum is σ = 355787540106240. Its totient is φ = 355218701533920.
The previous prime is 355503114130127. The next prime is 355503114130141. The reversal of 355503114130133 is 331031411305553.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 355503114130133 - 218 = 355503113867989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (355503114130183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50158316 + ... + 56805482.
It is an arithmetic number, because the mean of its divisors is an integer number (44473442513280).
Almost surely, 2355503114130133 is an apocalyptic number.
It is an amenable number.
355503114130133 is a deficient number, since it is larger than the sum of its proper divisors (284425976107).
355503114130133 is a wasteful number, since it uses less digits than its factorization.
355503114130133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6689947.
The product of its (nonzero) digits is 121500, while the sum is 38.
Adding to 355503114130133 its reverse (331031411305553), we get a palindrome (686534525435686).
The spelling of 355503114130133 in words is "three hundred fifty-five trillion, five hundred three billion, one hundred fourteen million, one hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •