Base | Representation |
---|---|
bin | 10010001110011001101… |
… | …001010011000111110101 |
3 | 11102201200211102201210020 |
4 | 102032121221103013311 |
5 | 131004420241122123 |
6 | 2355203425515353 |
7 | 156324652515402 |
oct | 22163151230765 |
9 | 4381624381706 |
10 | 1252413223413 |
11 | 443166683660 |
12 | 1828867a2b59 |
13 | 911432c3181 |
14 | 4488d55b2a9 |
15 | 228a13697e3 |
hex | 12399a531f5 |
1252413223413 has 16 divisors (see below), whose sum is σ = 1821798950400. Its totient is φ = 758993738480.
The previous prime is 1252413223363. The next prime is 1252413223421. The reversal of 1252413223413 is 3143223142521.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1252413223413 - 28 = 1252413223157 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1252413223423) 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, 539643 + ... + 1672136.
It is an arithmetic number, because the mean of its divisors is an integer number (113862434400).
Almost surely, 21252413223413 is an apocalyptic number.
It is an amenable number.
1252413223413 is a deficient number, since it is larger than the sum of its proper divisors (569385726987).
1252413223413 is a wasteful number, since it uses less digits than its factorization.
1252413223413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228952.
The product of its digits is 34560, while the sum is 33.
Adding to 1252413223413 its reverse (3143223142521), we get a palindrome (4395636365934).
It can be divided in two parts, 12524132 and 23413, that added together give a triangular number (12547545 = T5009).
The spelling of 1252413223413 in words is "one trillion, two hundred fifty-two billion, four hundred thirteen million, two hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •