Base | Representation |
---|---|
bin | 10001110011010011000… |
… | …001010110110001001000 |
3 | 11022221120122120122201112 |
4 | 101303103001112301020 |
5 | 130020320112410130 |
6 | 2333551545305452 |
7 | 154244534305136 |
oct | 21632301266110 |
9 | 4287518518645 |
10 | 1223311060040 |
11 | 431892224573 |
12 | 179104495288 |
13 | 8b485c47b64 |
14 | 432cc468756 |
15 | 21c4b491495 |
hex | 11cd3056c48 |
1223311060040 has 64 divisors (see below), whose sum is σ = 2955406124160. Its totient is φ = 454054128640.
The previous prime is 1223311060003. The next prime is 1223311060051. The reversal of 1223311060040 is 400601133221.
It is a junction number, because it is equal to n+sod(n) for n = 1223311059988 and 1223311060015.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 12620642 + ... + 12717201.
It is an arithmetic number, because the mean of its divisors is an integer number (46178220690).
Almost surely, 21223311060040 is an apocalyptic number.
1223311060040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1223311060040 is an abundant number, since it is smaller than the sum of its proper divisors (1732095064120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1223311060040 is a wasteful number, since it uses less digits than its factorization.
1223311060040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25337942 (or 25337938 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1223311060040 its reverse (400601133221), we get a palindrome (1623912193261).
The spelling of 1223311060040 in words is "one trillion, two hundred twenty-three billion, three hundred eleven million, sixty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •