Base | Representation |
---|---|
bin | 10001110000100110000… |
… | …110110001010111001101 |
3 | 11022200002110202121202012 |
4 | 101300212012301113031 |
5 | 124443344431140300 |
6 | 2332352034111005 |
7 | 154112620010255 |
oct | 21604606612715 |
9 | 4280073677665 |
10 | 1220410021325 |
11 | 430633706210 |
12 | 178634a1b465 |
13 | 8b112c023c1 |
14 | 430d5062965 |
15 | 21b2b949435 |
hex | 11c261b15cd |
1220410021325 has 48 divisors (see below), whose sum is σ = 1731317760000. Its totient is φ = 844713777600.
The previous prime is 1220410021301. The next prime is 1220410021361. The reversal of 1220410021325 is 5231200140221.
It is not a de Polignac number, because 1220410021325 - 214 = 1220410004941 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 1220410021325.
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 47 ways as a sum of consecutive naturals, for example, 773876 + ... + 1743474.
It is an arithmetic number, because the mean of its divisors is an integer number (36069120000).
Almost surely, 21220410021325 is an apocalyptic number.
It is an amenable number.
1220410021325 is a deficient number, since it is larger than the sum of its proper divisors (510907738675).
1220410021325 is a wasteful number, since it uses less digits than its factorization.
1220410021325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 969842 (or 969837 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 1220410021325 its reverse (5231200140221), we get a palindrome (6451610161546).
The spelling of 1220410021325 in words is "one trillion, two hundred twenty billion, four hundred ten million, twenty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •