Base | Representation |
---|---|
bin | 110010101001101010011… |
… | …011001001001010110101 |
3 | 110022202022121002011110021 |
4 | 302221222123021022311 |
5 | 424011443001310401 |
6 | 11223003213525141 |
7 | 506321133265411 |
oct | 62515233111265 |
9 | 13282277064407 |
10 | 3480709010101 |
11 | 1122184548a14 |
12 | 4827024a37b1 |
13 | 1c32ca14854b |
14 | c0678075d41 |
15 | 6081b9ad2a1 |
hex | 32a6a6c92b5 |
3480709010101 has 2 divisors, whose sum is σ = 3480709010102. Its totient is φ = 3480709010100.
The previous prime is 3480709010041. The next prime is 3480709010113. The reversal of 3480709010101 is 1010109070843.
3480709010101 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3101117478001 + 379591532100 = 1760999^2 + 616110^2 .
It is an emirp because it is prime and its reverse (1010109070843) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3480709010101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3480709010201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1740354505050 + 1740354505051.
It is an arithmetic number, because the mean of its divisors is an integer number (1740354505051).
Almost surely, 23480709010101 is an apocalyptic number.
It is an amenable number.
3480709010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3480709010101 is an equidigital number, since it uses as much as digits as its factorization.
3480709010101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 34.
The spelling of 3480709010101 in words is "three trillion, four hundred eighty billion, seven hundred nine million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •