Base | Representation |
---|---|
bin | 10111100001000010… |
… | …11100110100011110 |
3 | 1012120212121101211211 |
4 | 23300201130310132 |
5 | 201324030011410 |
6 | 5444442335034 |
7 | 624602504656 |
oct | 136041346436 |
9 | 35525541754 |
10 | 12625235230 |
11 | 5399686103 |
12 | 25441ba47a |
13 | 12628576ba |
14 | 87aa93366 |
15 | 4dd5c568a |
hex | 2f085cd1e |
12625235230 has 16 divisors (see below), whose sum is σ = 22731295680. Its totient is φ = 5048789152.
The previous prime is 12625235143. The next prime is 12625235257. The reversal of 12625235230 is 3253252621.
12625235230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×126252352302 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12625235192 and 12625235201.
It is a congruent number.
It is an unprimeable number.
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, 121990 + ... + 200329.
It is an arithmetic number, because the mean of its divisors is an integer number (1420705980).
Almost surely, 212625235230 is an apocalyptic number.
12625235230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12625235230 is a deficient number, since it is larger than the sum of its proper divisors (10106060450).
12625235230 is a wasteful number, since it uses less digits than its factorization.
12625235230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326243.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 12625235230 its reverse (3253252621), we get a palindrome (15878487851).
The spelling of 12625235230 in words is "twelve billion, six hundred twenty-five million, two hundred thirty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •