Base | Representation |
---|---|
bin | 11011111111110001110000… |
… | …000010010101101100111101 |
3 | 121010222010001112221101221000 |
4 | 123333301300002111230331 |
5 | 112114330221014244401 |
6 | 1113513050404400513 |
7 | 34635564144115140 |
oct | 3377616002255475 |
9 | 533863045841830 |
10 | 123130002103101 |
11 | 36262160216114 |
12 | 119875046a6139 |
13 | 53921563b9726 |
14 | 225974981c057 |
15 | e37d61ec6186 |
hex | 6ffc70095b3d |
123130002103101 has 64 divisors (see below), whose sum is σ = 223043879833600. Its totient is φ = 65564107992000.
The previous prime is 123130002103099. The next prime is 123130002103127. The reversal of 123130002103101 is 101301200031321.
123130002103101 is a `hidden beast` number, since 1 + 2 + 31 + 300 + 0 + 21 + 0 + 310 + 1 = 666.
It is not a de Polignac number, because 123130002103101 - 21 = 123130002103099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123130002102101) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 280834225 + ... + 281272326.
It is an arithmetic number, because the mean of its divisors is an integer number (3485060622400).
Almost surely, 2123130002103101 is an apocalyptic number.
It is an amenable number.
123130002103101 is a deficient number, since it is larger than the sum of its proper divisors (99913877730499).
123130002103101 is a wasteful number, since it uses less digits than its factorization.
123130002103101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562106647 (or 562106641 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 123130002103101 its reverse (101301200031321), we get a palindrome (224431202134422).
The spelling of 123130002103101 in words is "one hundred twenty-three trillion, one hundred thirty billion, two million, one hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •