Base | Representation |
---|---|
bin | 1010010101111111110… |
… | …10100101001011001011 |
3 | 1020222100221012111220020 |
4 | 11022333322211023023 |
5 | 21310333210420042 |
6 | 431134412031523 |
7 | 34451214462456 |
oct | 5127772451313 |
9 | 1228327174806 |
10 | 355407123147 |
11 | 127800067a6a |
12 | 58a691625a3 |
13 | 2768cb93a8b |
14 | 132b7a3049d |
15 | 93a1ac93ec |
hex | 52bfea52cb |
355407123147 has 4 divisors (see below), whose sum is σ = 473876164200. Its totient is φ = 236938082096.
The previous prime is 355407123143. The next prime is 355407123163. The reversal of 355407123147 is 741321704553.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 741321704553 = 3 ⋅247107234851.
It is a cyclic number.
It is not a de Polignac number, because 355407123147 - 22 = 355407123143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 355407123099 and 355407123108.
It is not an unprimeable number, because it can be changed into a prime (355407123143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59234520522 + ... + 59234520527.
It is an arithmetic number, because the mean of its divisors is an integer number (118469041050).
Almost surely, 2355407123147 is an apocalyptic number.
355407123147 is a deficient number, since it is larger than the sum of its proper divisors (118469041053).
355407123147 is a wasteful number, since it uses less digits than its factorization.
355407123147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118469041052.
The product of its (nonzero) digits is 352800, while the sum is 42.
The spelling of 355407123147 in words is "three hundred fifty-five billion, four hundred seven million, one hundred twenty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •