Base | Representation |
---|---|
bin | 10010000110110000111… |
… | …000000011001000000001 |
3 | 11101221112100022211002212 |
4 | 102012300320003020001 |
5 | 130341122014001200 |
6 | 2351330015151505 |
7 | 155614521161210 |
oct | 22066070031001 |
9 | 4357470284085 |
10 | 1244213031425 |
11 | 43a738901a91 |
12 | 181178515595 |
13 | 90437459570 |
14 | 44312461077 |
15 | 225714c8035 |
hex | 121b0e03201 |
1244213031425 has 48 divisors (see below), whose sum is σ = 1899173028480. Its totient is φ = 787416215040.
The previous prime is 1244213031421. The next prime is 1244213031437. The reversal of 1244213031425 is 5241303124421.
It is not a de Polignac number, because 1244213031425 - 22 = 1244213031421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1244213031391 and 1244213031400.
It is not an unprimeable number, because it can be changed into a prime (1244213031421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14866346 + ... + 14949804.
It is an arithmetic number, because the mean of its divisors is an integer number (39566104760).
Almost surely, 21244213031425 is an apocalyptic number.
It is an amenable number.
1244213031425 is a deficient number, since it is larger than the sum of its proper divisors (654959997055).
1244213031425 is a wasteful number, since it uses less digits than its factorization.
1244213031425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90042 (or 90037 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 1244213031425 its reverse (5241303124421), we get a palindrome (6485516155846).
The spelling of 1244213031425 in words is "one trillion, two hundred forty-four billion, two hundred thirteen million, thirty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •