Base | Representation |
---|---|
bin | 10000000011100010000… |
… | …010111001111101110100 |
3 | 10220110211011012101222000 |
4 | 100003202002321331310 |
5 | 121034031313242213 |
6 | 2202503442335300 |
7 | 142465621415061 |
oct | 20034202717564 |
9 | 3813734171860 |
10 | 1103304040308 |
11 | 3959aa405418 |
12 | 1599b235a530 |
13 | 8006c473602 |
14 | 3b586215c68 |
15 | 1da75aa0c73 |
hex | 100e20b9f74 |
1103304040308 has 48 divisors (see below), whose sum is σ = 2861772197760. Its totient is φ = 367593887232.
The previous prime is 1103304040249. The next prime is 1103304040343. The reversal of 1103304040308 is 8030404033011.
1103304040308 is a `hidden beast` number, since 1 + 10 + 3 + 304 + 0 + 40 + 308 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 2189160 + ... + 2645567.
It is an arithmetic number, because the mean of its divisors is an integer number (59620254120).
Almost surely, 21103304040308 is an apocalyptic number.
1103304040308 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1103304040308 is an abundant number, since it is smaller than the sum of its proper divisors (1758468157452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103304040308 is a wasteful number, since it uses less digits than its factorization.
1103304040308 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4836853 (or 4836845 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1103304040308 its reverse (8030404033011), we get a palindrome (9133708073319).
The spelling of 1103304040308 in words is "one trillion, one hundred three billion, three hundred four million, forty thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •