Base | Representation |
---|---|
bin | 111011101011011… |
… | …100100101100010 |
3 | 2120210000111222010 |
4 | 323223130211202 |
5 | 4022304320101 |
6 | 243204053350 |
7 | 33545304465 |
oct | 7353344542 |
9 | 2523014863 |
10 | 1001245026 |
11 | 4741a4231 |
12 | 23b394256 |
13 | 12c584aa2 |
14 | 96d932dc |
15 | 5cd7a2d6 |
hex | 3badc962 |
1001245026 has 8 divisors (see below), whose sum is σ = 2002490064. Its totient is φ = 333748340.
The previous prime is 1001244953. The next prime is 1001245027. The reversal of 1001245026 is 6205421001.
It is a sphenic number, since it is the product of 3 distinct primes.
1001245026 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1001244993 and 1001245011.
It is not an unprimeable number, because it can be changed into a prime (1001245027) 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 3 ways as a sum of consecutive naturals, for example, 83437080 + ... + 83437091.
It is an arithmetic number, because the mean of its divisors is an integer number (250311258).
Almost surely, 21001245026 is an apocalyptic number.
1001245026 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001245026 is a wasteful number, since it uses less digits than its factorization.
1001245026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166874176.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1001245026 is about 31642.4560677581. The cubic root of 1001245026 is about 1000.4148365535.
Adding to 1001245026 its reverse (6205421001), we get a palindrome (7206666027).
The spelling of 1001245026 in words is "one billion, one million, two hundred forty-five thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •