Base | Representation |
---|---|
bin | 10011001110010011000… |
… | …111101011001000101000 |
3 | 11200021210101020210121120 |
4 | 103032103013223020220 |
5 | 133120423421103222 |
6 | 2450511504135240 |
7 | 164304121055613 |
oct | 23162307531050 |
9 | 4607711223546 |
10 | 1321023222312 |
11 | 46a274196292 |
12 | 194034007520 |
13 | 97758780261 |
14 | 47d1b70517a |
15 | 2456990d15c |
hex | 133931eb228 |
1321023222312 has 64 divisors (see below), whose sum is σ = 3333316147200. Its totient is φ = 436249900800.
The previous prime is 1321023222283. The next prime is 1321023222329. The reversal of 1321023222312 is 2132223201231.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 15 ways as a sum of consecutive naturals, for example, 1827514 + ... + 2445782.
It is an arithmetic number, because the mean of its divisors is an integer number (52083064800).
Almost surely, 21321023222312 is an apocalyptic number.
1321023222312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1321023222312 is an abundant number, since it is smaller than the sum of its proper divisors (2012292924888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321023222312 is a wasteful number, since it uses less digits than its factorization.
1321023222312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619106 (or 619102 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1321023222312 its reverse (2132223201231), we get a palindrome (3453246423543).
The spelling of 1321023222312 in words is "one trillion, three hundred twenty-one billion, twenty-three million, two hundred twenty-two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •