Base | Representation |
---|---|
bin | 1001010111110010100010… |
… | …1111010011101100110000 |
3 | 1100111002020002020122121202 |
4 | 2111330220233103230300 |
5 | 2322311211332030300 |
6 | 33525422405110332 |
7 | 2112314260061261 |
oct | 225745057235460 |
9 | 40432202218552 |
10 | 10304310033200 |
11 | 3313040421027 |
12 | 11a50646b83a8 |
13 | 5998ccbaa321 |
14 | 278a3484a968 |
15 | 12d08abb8ad5 |
hex | 95f28bd3b30 |
10304310033200 has 60 divisors (see below), whose sum is σ = 24756512477328. Its totient is φ = 4121656147200.
The previous prime is 10304310033191. The next prime is 10304310033203. The reversal of 10304310033200 is 233001340301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (10304310033203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29205845 + ... + 29556555.
Almost surely, 210304310033200 is an apocalyptic number.
10304310033200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10304310033200 is an abundant number, since it is smaller than the sum of its proper divisors (14452202444128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10304310033200 is a wasteful number, since it uses less digits than its factorization.
10304310033200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424182 (or 424171 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10304310033200 its reverse (233001340301), we get a palindrome (10537311373501).
The spelling of 10304310033200 in words is "ten trillion, three hundred four billion, three hundred ten million, thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •