Base | Representation |
---|---|
bin | 11011111111010101111010… |
… | …100000100100110010011101 |
3 | 121010212020220112101012001201 |
4 | 123333111322200210302131 |
5 | 112113333012413432201 |
6 | 1113451224454035501 |
7 | 34633455362152201 |
oct | 3377257240446235 |
9 | 533766815335051 |
10 | 123100113030301 |
11 | 36250512657360 |
12 | 11981762948b91 |
13 | 538c3a1cc2a34 |
14 | 225811200ab01 |
15 | e371b2eae801 |
hex | 6ff57a824c9d |
123100113030301 has 16 divisors (see below), whose sum is σ = 137474485444800. Its totient is φ = 109282712918400.
The previous prime is 123100113030283. The next prime is 123100113030311. The reversal of 123100113030301 is 103030311001321.
It is a cyclic number.
It is not a de Polignac number, because 123100113030301 - 27 = 123100113030173 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 (123100113030311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 659826496 + ... + 660013033.
It is an arithmetic number, because the mean of its divisors is an integer number (8592155340300).
Almost surely, 2123100113030301 is an apocalyptic number.
123100113030301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
123100113030301 is a deficient number, since it is larger than the sum of its proper divisors (14374372414499).
123100113030301 is a wasteful number, since it uses less digits than its factorization.
123100113030301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319839740.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 123100113030301 its reverse (103030311001321), we get a palindrome (226130424031622).
The spelling of 123100113030301 in words is "one hundred twenty-three trillion, one hundred billion, one hundred thirteen million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •