Base | Representation |
---|---|
bin | 1001001101110010100111… |
… | …1111010011100110000010 |
3 | 1022212122211121011022002012 |
4 | 2103130221333103212002 |
5 | 2312002411232444300 |
6 | 33314453204252522 |
7 | 2064023411406632 |
oct | 223345177234602 |
9 | 38778747138065 |
10 | 10132532312450 |
11 | 3257201376a59 |
12 | 11779046a1142 |
13 | 586655863b92 |
14 | 2705baa5a6c2 |
15 | 128885266435 |
hex | 93729fd3982 |
10132532312450 has 96 divisors (see below), whose sum is σ = 20166291774720. Its totient is φ = 3778350540800.
The previous prime is 10132532312423. The next prime is 10132532312459. The reversal of 10132532312450 is 5421323523101.
It is a super-2 number, since 2×101325323124502 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10132532312459) 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 47 ways as a sum of consecutive naturals, for example, 45955571 + ... + 46175529.
It is an arithmetic number, because the mean of its divisors is an integer number (210065539320).
Almost surely, 210132532312450 is an apocalyptic number.
10132532312450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10132532312450 is a deficient number, since it is larger than the sum of its proper divisors (10033759462270).
10132532312450 is a wasteful number, since it uses less digits than its factorization.
10132532312450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221012 (or 221007 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 10132532312450 its reverse (5421323523101), we get a palindrome (15553855835551).
The spelling of 10132532312450 in words is "ten trillion, one hundred thirty-two billion, five hundred thirty-two million, three hundred twelve thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •