Base | Representation |
---|---|
bin | 11101001010110010010… |
… | …10100010000010011010 |
3 | 10112210220122222102121211 |
4 | 32211121022202002122 |
5 | 112410023132004200 |
6 | 2044225351453334 |
7 | 132260012413201 |
oct | 16453112420232 |
9 | 3483818872554 |
10 | 1002223313050 |
11 | 357049a289a3 |
12 | 1422a268724a |
13 | 73680aa05ab |
14 | 36717832238 |
15 | 1b10ba3aaba |
hex | e9592a209a |
1002223313050 has 48 divisors (see below), whose sum is σ = 1924638815232. Its totient is φ = 388031817600.
The previous prime is 1002223313041. The next prime is 1002223313059. The reversal of 1002223313050 is 503133222001.
It is an interprime number because it is at equal distance from previous prime (1002223313041) and next prime (1002223313059).
It is not an unprimeable number, because it can be changed into a prime (1002223313059) 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 23 ways as a sum of consecutive naturals, for example, 1664412 + ... + 2185111.
It is an arithmetic number, because the mean of its divisors is an integer number (40096641984).
Almost surely, 21002223313050 is an apocalyptic number.
1002223313050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1002223313050 is a deficient number, since it is larger than the sum of its proper divisors (922415502182).
1002223313050 is a wasteful number, since it uses less digits than its factorization.
1002223313050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3849703 (or 3849698 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 1002223313050 its reverse (503133222001), we get a palindrome (1505356535051).
The spelling of 1002223313050 in words is "one trillion, two billion, two hundred twenty-three million, three hundred thirteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •