Base | Representation |
---|---|
bin | 11101010000011010010… |
… | …11011100011100000110 |
3 | 10120002201010220100020012 |
4 | 32220031023130130012 |
5 | 112432214310414032 |
6 | 2045445155510222 |
7 | 132424604231420 |
oct | 16501513343406 |
9 | 3502633810205 |
10 | 1005243451142 |
11 | 3583597a3397 |
12 | 1429a5bb8372 |
13 | 73a426b6058 |
14 | 3692299b810 |
15 | 1b236c5b6b2 |
hex | ea0d2dc706 |
1005243451142 has 32 divisors (see below), whose sum is σ = 1725060587520. Its totient is φ = 430372323360.
The previous prime is 1005243451139. The next prime is 1005243451169. The reversal of 1005243451142 is 2411543425001.
It is a super-2 number, since 2×10052434511422 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1005243451099 and 1005243451108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72422159 + ... + 72436037.
It is an arithmetic number, because the mean of its divisors is an integer number (53908143360).
Almost surely, 21005243451142 is an apocalyptic number.
1005243451142 is a deficient number, since it is larger than the sum of its proper divisors (719817136378).
1005243451142 is a wasteful number, since it uses less digits than its factorization.
1005243451142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18876.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 1005243451142 its reverse (2411543425001), we get a palindrome (3416786876143).
The spelling of 1005243451142 in words is "one trillion, five billion, two hundred forty-three million, four hundred fifty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •