Base | Representation |
---|---|
bin | 100100100001000010011101… |
… | …1000111010111111001101010 |
3 | 1120010021102122200211122201220 |
4 | 1021002010323013113321222 |
5 | 314100020321440120020 |
6 | 3055045144252522510 |
7 | 124440641300045031 |
oct | 11102047307277152 |
9 | 1503242580748656 |
10 | 321200121020010 |
11 | 9338722a711791 |
12 | 3003689a780436 |
13 | 10a2c07009680b |
14 | 59462512c1718 |
15 | 2720243d38240 |
hex | 124213b1d7e6a |
321200121020010 has 32 divisors (see below), whose sum is σ = 770940890396352. Its totient is φ = 85646632277760.
The previous prime is 321200121019961. The next prime is 321200121020017. The reversal of 321200121020010 is 10020121002123.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (321200121020017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 420444984 + ... + 421208243.
It is an arithmetic number, because the mean of its divisors is an integer number (24091902824886).
Almost surely, 2321200121020010 is an apocalyptic number.
321200121020010 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
321200121020010 is an abundant number, since it is smaller than the sum of its proper divisors (449740769376342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321200121020010 is a wasteful number, since it uses less digits than its factorization.
321200121020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 841665958.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 321200121020010 its reverse (10020121002123), we get a palindrome (331220242022133).
The spelling of 321200121020010 in words is "three hundred twenty-one trillion, two hundred billion, one hundred twenty-one million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •