Base | Representation |
---|---|
bin | 11101001100101001001… |
… | …00101011011100001010 |
3 | 10112220111010110112201000 |
4 | 32212110210223130022 |
5 | 112414043311214200 |
6 | 2044512314435430 |
7 | 132323504332230 |
oct | 16462444533412 |
9 | 3486433415630 |
10 | 1003220023050 |
11 | 357510604973 |
12 | 142520432b76 |
13 | 737ac42811b |
14 | 367add64950 |
15 | 1b1692bc300 |
hex | e99492b70a |
1003220023050 has 192 divisors, whose sum is σ = 3236405356800. Its totient is φ = 223714483200.
The previous prime is 1003220023019. The next prime is 1003220023051. The reversal of 1003220023050 is 503200223001.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1003220023051) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 907195 + ... + 1682094.
It is an arithmetic number, because the mean of its divisors is an integer number (16856277900).
Almost surely, 21003220023050 is an apocalyptic number.
1003220023050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1003220023050 is an abundant number, since it is smaller than the sum of its proper divisors (2233185333750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1003220023050 is a wasteful number, since it uses less digits than its factorization.
1003220023050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2589358 (or 2589347 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
Adding to 1003220023050 its reverse (503200223001), we get a palindrome (1506420246051).
The spelling of 1003220023050 in words is "one trillion, three billion, two hundred twenty million, twenty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •