Base | Representation |
---|---|
bin | 10000000001110010011… |
… | …110001000111011100100 |
3 | 10220021222200212120112202 |
4 | 100001302132020323210 |
5 | 121021213111200200 |
6 | 2201554013034032 |
7 | 142401341433314 |
oct | 20016236107344 |
9 | 3807880776482 |
10 | 1101432131300 |
11 | 3951297a6486 |
12 | 15956b485918 |
13 | 7cb316c6b47 |
14 | 3b449781444 |
15 | 1d9b65911d5 |
hex | 10072788ee4 |
1101432131300 has 36 divisors (see below), whose sum is σ = 2398613507556. Its totient is φ = 439004966400.
The previous prime is 1101432131279. The next prime is 1101432131323. The reversal of 1101432131300 is 31312341011.
It can be written as a sum of positive squares in 6 ways, for example, as 75441411556 + 1025990719744 = 274666^2 + 1012912^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19570337 + ... + 19626536.
Almost surely, 21101432131300 is an apocalyptic number.
1101432131300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101432131300 is an abundant number, since it is smaller than the sum of its proper divisors (1297181376256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101432131300 is a wasteful number, since it uses less digits than its factorization.
1101432131300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39197168 (or 39197161 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1101432131300 its reverse (31312341011), we get a palindrome (1132744472311).
The spelling of 1101432131300 in words is "one trillion, one hundred one billion, four hundred thirty-two million, one hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •