Base | Representation |
---|---|
bin | 10011001101101000000… |
… | …001101001101000111000 |
3 | 11200012220222210122001110 |
4 | 103031220001221220320 |
5 | 133112433324114112 |
6 | 2450312035520320 |
7 | 164250161504160 |
oct | 23155001515070 |
9 | 4605828718043 |
10 | 1320300223032 |
11 | 469a3306821a |
12 | 193a71a590a0 |
13 | 97671a4a52b |
14 | 47c8d6a15a0 |
15 | 245261e613c |
hex | 13368069a38 |
1320300223032 has 64 divisors (see below), whose sum is σ = 3772503486720. Its totient is φ = 377206921728.
The previous prime is 1320300222977. The next prime is 1320300223057. The reversal of 1320300223032 is 2303220030231.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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, 2823163 + ... + 3257429.
It is an arithmetic number, because the mean of its divisors is an integer number (58945366980).
Almost surely, 21320300223032 is an apocalyptic number.
1320300223032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1320300223032 is an abundant number, since it is smaller than the sum of its proper divisors (2452203263688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320300223032 is a wasteful number, since it uses less digits than its factorization.
1320300223032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452380 (or 452376 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 1320300223032 its reverse (2303220030231), we get a palindrome (3623520253263).
The spelling of 1320300223032 in words is "one trillion, three hundred twenty billion, three hundred million, two hundred twenty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •