Base | Representation |
---|---|
bin | 101010011110001… |
… | …0111110010100110 |
3 | 10200022121012110110 |
4 | 1110330113302212 |
5 | 10404312042410 |
6 | 353225033450 |
7 | 50213153103 |
oct | 12474276246 |
9 | 3608535413 |
10 | 1425112230 |
11 | 671490a03 |
12 | 339325886 |
13 | 199331a99 |
14 | d73abaaa |
15 | 851a5720 |
hex | 54f17ca6 |
1425112230 has 32 divisors (see below), whose sum is σ = 3484806624. Its totient is φ = 372859136.
The previous prime is 1425112219. The next prime is 1425112237. The reversal of 1425112230 is 322115241.
It is a junction number, because it is equal to n+sod(n) for n = 1425112197 and 1425112206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425112237) 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 15 ways as a sum of consecutive naturals, for example, 446559 + ... + 449738.
It is an arithmetic number, because the mean of its divisors is an integer number (108900207).
Almost surely, 21425112230 is an apocalyptic number.
1425112230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1425112230 is an abundant number, since it is smaller than the sum of its proper divisors (2059694394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425112230 is a wasteful number, since it uses less digits than its factorization.
1425112230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896360.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1425112230 is about 37750.6586697504. The cubic root of 1425112230 is about 1125.3380988740.
Adding to 1425112230 its reverse (322115241), we get a palindrome (1747227471).
The spelling of 1425112230 in words is "one billion, four hundred twenty-five million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •