Base | Representation |
---|---|
bin | 100111110010101011000010… |
… | …1100101010011100100011011 |
3 | 1200220021211011211220222110001 |
4 | 1033211112011211103210123 |
5 | 331334044044304032024 |
6 | 3240225144215033431 |
7 | 133503350631100153 |
oct | 11745260545234433 |
9 | 1626254154828401 |
10 | 350012011002139 |
11 | a1585295464262 |
12 | 3330a80a36b877 |
13 | 1203bcb6342345 |
14 | 62609592c3763 |
15 | 2a6e937bb4244 |
hex | 13e558595391b |
350012011002139 has 2 divisors, whose sum is σ = 350012011002140. Its totient is φ = 350012011002138.
The previous prime is 350012011002097. The next prime is 350012011002151. The reversal of 350012011002139 is 931200110210053.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 350012011002139 - 225 = 350011977447707 is a prime.
It is a super-2 number, since 2×3500120110021392 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (350012111002139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 175006005501069 + 175006005501070.
It is an arithmetic number, because the mean of its divisors is an integer number (175006005501070).
Almost surely, 2350012011002139 is an apocalyptic number.
350012011002139 is a deficient number, since it is larger than the sum of its proper divisors (1).
350012011002139 is an equidigital number, since it uses as much as digits as its factorization.
350012011002139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 28.
The spelling of 350012011002139 in words is "three hundred fifty trillion, twelve billion, eleven million, two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •