Base | Representation |
---|---|
bin | 10110100110000010… |
… | …11011000001110111 |
3 | 1011022101022002101020 |
4 | 23103001123001313 |
5 | 144320324100043 |
6 | 5323402232223 |
7 | 606412564122 |
oct | 132301330167 |
9 | 34271262336 |
10 | 12130300023 |
11 | 5165268a46 |
12 | 24264b5673 |
13 | 11b4156a2a |
14 | 8310593b9 |
15 | 4aee0ce83 |
hex | 2d305b077 |
12130300023 has 8 divisors (see below), whose sum is σ = 16188063600. Its totient is φ = 8079701568.
The previous prime is 12130300001. The next prime is 12130300099. The reversal of 12130300023 is 32000303121.
12130300023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12130300023 - 25 = 12130299991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12130299975 and 12130300011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12130300223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1787328 + ... + 1794101.
It is an arithmetic number, because the mean of its divisors is an integer number (2023507950).
Almost surely, 212130300023 is an apocalyptic number.
12130300023 is a deficient number, since it is larger than the sum of its proper divisors (4057763577).
12130300023 is a wasteful number, since it uses less digits than its factorization.
12130300023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3582561.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 12130300023 its reverse (32000303121), we get a palindrome (44130603144).
The spelling of 12130300023 in words is "twelve billion, one hundred thirty million, three hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •