Base | Representation |
---|---|
bin | 11110000010110110010… |
… | …01101000000100100000 |
3 | 10122200121020211201112102 |
4 | 33001123021220010200 |
5 | 113403143234313440 |
6 | 2110124130145532 |
7 | 134403613062122 |
oct | 17013311500440 |
9 | 3580536751472 |
10 | 1032321401120 |
11 | 368894577a49 |
12 | 1480a24222a8 |
13 | 76469589b69 |
14 | 37d70cd1212 |
15 | 1bcbe08cb15 |
hex | f05b268120 |
1032321401120 has 48 divisors (see below), whose sum is σ = 2438988080760. Its totient is φ = 412906758144.
The previous prime is 1032321401101. The next prime is 1032321401141. The reversal of 1032321401120 is 211041232301.
It can be written as a sum of positive squares in 4 ways, for example, as 880692156304 + 151629244816 = 938452^2 + 389396^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1032321401092 and 1032321401101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3060374 + ... + 3380906.
Almost surely, 21032321401120 is an apocalyptic number.
1032321401120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1032321401120 is an abundant number, since it is smaller than the sum of its proper divisors (1406666679640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032321401120 is a wasteful number, since it uses less digits than its factorization.
1032321401120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340677 (or 340669 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1032321401120 its reverse (211041232301), we get a palindrome (1243362633421).
The spelling of 1032321401120 in words is "one trillion, thirty-two billion, three hundred twenty-one million, four hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •