Base | Representation |
---|---|
bin | 1001011000001000011111… |
… | …0101000000111011100000 |
3 | 1100111122102120212211112120 |
4 | 2112002013311000323200 |
5 | 2322410242241111000 |
6 | 33532235102424240 |
7 | 2112613242561132 |
oct | 226020765007340 |
9 | 40448376784476 |
10 | 10310200332000 |
11 | 3315593334768 |
12 | 11a6229292080 |
13 | 59a32b316a2a |
14 | 279032c61052 |
15 | 12d2d2d826a0 |
hex | 96087d40ee0 |
10310200332000 has 96 divisors (see below), whose sum is σ = 33776216326944. Its totient is φ = 2749386752000.
The previous prime is 10310200331969. The next prime is 10310200332011. The reversal of 10310200332000 is 23300201301.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429579681 + ... + 429603680.
It is an arithmetic number, because the mean of its divisors is an integer number (351835586739).
Almost surely, 210310200332000 is an apocalyptic number.
10310200332000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10310200332000 is an abundant number, since it is smaller than the sum of its proper divisors (23466015994944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10310200332000 is an equidigital number, since it uses as much as digits as its factorization.
10310200332000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 859183389 (or 859183371 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10310200332000 its reverse (23300201301), we get a palindrome (10333500533301).
The spelling of 10310200332000 in words is "ten trillion, three hundred ten billion, two hundred million, three hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •