Base | Representation |
---|---|
bin | 100001000000110… |
… | …0010111010100100 |
3 | 2212012100001200020 |
4 | 1002001202322210 |
5 | 4232032421122 |
6 | 301525515140 |
7 | 36310210116 |
oct | 10201427244 |
9 | 2765301606 |
10 | 1107701412 |
11 | 5192a5514 |
12 | 26ab72ab0 |
13 | 14864922c |
14 | a71853b6 |
15 | 673a7c5c |
hex | 42062ea4 |
1107701412 has 24 divisors (see below), whose sum is σ = 2654492736. Its totient is φ = 359254368.
The previous prime is 1107701377. The next prime is 1107701471. The reversal of 1107701412 is 2141077011.
It is a super-3 number, since 3×11077014123 (a number of 28 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1246968 + ... + 1247855.
It is an arithmetic number, because the mean of its divisors is an integer number (110603864).
Almost surely, 21107701412 is an apocalyptic number.
1107701412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1107701412 is an abundant number, since it is smaller than the sum of its proper divisors (1546791324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107701412 is a wasteful number, since it uses less digits than its factorization.
1107701412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2494867 (or 2494865 counting only the distinct ones).
The product of its (nonzero) digits is 392, while the sum is 24.
The square root of 1107701412 is about 33282.1485484336. The cubic root of 1107701412 is about 1034.6836102635.
Adding to 1107701412 its reverse (2141077011), we get a palindrome (3248778423).
The spelling of 1107701412 in words is "one billion, one hundred seven million, seven hundred one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •